9,835,100

2² × 5² × 11 × 8941

9,835,100 factors as 2^2 × 5^2 × 11 × 8941. Its 36 positive divisors give a proper-divisor sum of 13,449,868, so this integer is abundant. The Collatz stopping time is 282 steps.

Prime Factor Structure

Factorization String 2^2 × 5^2 × 11 × 8941

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 23,284,968

Proper Divisor Sum 13,449,868

Digit Sum / Digital Root 26 (Root: 8)

Adjacent Primes #9835073 ← → #9835109

Radix Representation

Decimal	9835100
Binary	100101100001001001011100 (24 bits)
Octal	0o45411134
Hexadecimal	0x96125C

Divisor Catalog (36)

1 2 4 5 10 11 20 22 25 44 50 55 100 110 220 275 550 1,100 8,941 17,882 35,764 44,705 89,410 98,351 178,820 196,702 223,525 393,404 447,050 491,755 894,100 983,510 1,967,020 2,458,775 4,917,550 9,835,100

Collatz Trajectory (282 steps to reach 1)

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

9,835,100 4,917,550 2,458,775 7,376,326 3,688,163 11,064,490 5,532,245 16,596,736 8,298,368 4,149,184 2,074,592 1,037,296 518,648 259,324 129,662 64,831 194,494 97,247 291,742 145,871 437,614 218,807 656,422 328,211 984,634 492,317 1,476,952 738,476 369,238 184,619 553,858 276,929 830,788 415,394 207,697 623,092 311,546 155,773 467,320 233,660 116,830 58,415 175,246 87,623 262,870 131,435 394,306 197,153 591,460 295,730 147,865 443,596 221,798 110,899 332,698 166,349 499,048 249,524 124,762 62,381

← Previous Integer #9,835,099 Browse Full Index Next Integer #9,835,101 →