9,824,928

2⁵ × 3 × 53 × 1931

9,824,928 factors as 2^5 × 3 × 53 × 1931. Its 48 positive divisors give a proper-divisor sum of 16,465,728, so this integer is abundant. The Collatz stopping time is 83 steps.

Prime Factor Structure

Factorization String 2^5 × 3 × 53 × 1931

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 26,290,656

Proper Divisor Sum 16,465,728

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #9824917 ← → #9824951

Radix Representation

Decimal	9824928
Binary	100101011110101010100000 (24 bits)
Octal	0o45365240
Hexadecimal	0x95EAA0

Divisor Catalog (48)

1 2 3 4 6 8 12 16 24 32 48 53 96 106 159 212 318 424 636 848 1,272 1,696 1,931 2,544 3,862 5,088 5,793 7,724 11,586 15,448 23,172 30,896 46,344 61,792 92,688 102,343 185,376 204,686 307,029 409,372 614,058 818,744 1,228,116 1,637,488 2,456,232 3,274,976 4,912,464 9,824,928

Collatz Trajectory (83 steps to reach 1)

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

9,824,928 4,912,464 2,456,232 1,228,116 614,058 307,029 921,088 460,544 230,272 115,136 57,568 28,784 14,392 7,196 3,598 1,799 5,398 2,699 8,098 4,049 12,148 6,074 3,037 9,112 4,556 2,278 1,139 3,418 1,709 5,128 2,564 1,282 641 1,924 962 481 1,444 722 361 1,084 542 271 814 407 1,222 611 1,834 917 2,752 1,376 688 344 172 86 43 130 65 196 98 49

← Previous Integer #9,824,927 Browse Full Index Next Integer #9,824,929 →