8,824,848

2⁴ × 3 × 113 × 1627

8,824,848 factors as 2^4 × 3 × 113 × 1627. Its 40 positive divisors give a proper-divisor sum of 14,188,560, so this integer is abundant. The Collatz stopping time is 150 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 113 × 1627

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 23,013,408

Proper Divisor Sum 14,188,560

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #8824843 ← → #8824859

Radix Representation

Decimal	8824848
Binary	100001101010100000010000 (24 bits)
Octal	0o41524020
Hexadecimal	0x86A810

Divisor Catalog (40)

1 2 3 4 6 8 12 16 24 48 113 226 339 452 678 904 1,356 1,627 1,808 2,712 3,254 4,881 5,424 6,508 9,762 13,016 19,524 26,032 39,048 78,096 183,851 367,702 551,553 735,404 1,103,106 1,470,808 2,206,212 2,941,616 4,412,424 8,824,848

Collatz Trajectory (150 steps to reach 1)

Iterative sequence n → n/2 (if even) or 3n+1 (if odd):

8,824,848 4,412,424 2,206,212 1,103,106 551,553 1,654,660 827,330 413,665 1,240,996 620,498 310,249 930,748 465,374 232,687 698,062 349,031 1,047,094 523,547 1,570,642 785,321 2,355,964 1,177,982 588,991 1,766,974 883,487 2,650,462 1,325,231 3,975,694 1,987,847 5,963,542 2,981,771 8,945,314 4,472,657 13,417,972 6,708,986 3,354,493 10,063,480 5,031,740 2,515,870 1,257,935 3,773,806 1,886,903 5,660,710 2,830,355 8,491,066 4,245,533 12,736,600 6,368,300 3,184,150 1,592,075 4,776,226 2,388,113 7,164,340 3,582,170 1,791,085 5,373,256 2,686,628 1,343,314 671,657 2,014,972

← Previous Integer #8,824,847 Browse Full Index Next Integer #8,824,849 →