8,933,520

2⁴ × 3 × 5 × 37223

8,933,520 factors as 2^4 × 3 × 5 × 37223. Its 40 positive divisors give a proper-divisor sum of 18,761,136, so this integer is abundant. The Collatz stopping time is 168 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 5 × 37223

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 27,694,656

Proper Divisor Sum 18,761,136

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #8933513 ← → #8933563

Radix Representation

Decimal	8933520
Binary	100010000101000010010000 (24 bits)
Octal	0o42050220
Hexadecimal	0x885090

Divisor Catalog (40)

1 2 3 4 5 6 8 10 12 15 16 20 24 30 40 48 60 80 120 240 37,223 74,446 111,669 148,892 186,115 223,338 297,784 372,230 446,676 558,345 595,568 744,460 893,352 1,116,690 1,488,920 1,786,704 2,233,380 2,977,840 4,466,760 8,933,520

Collatz Trajectory (168 steps to reach 1)

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

8,933,520 4,466,760 2,233,380 1,116,690 558,345 1,675,036 837,518 418,759 1,256,278 628,139 1,884,418 942,209 2,826,628 1,413,314 706,657 2,119,972 1,059,986 529,993 1,589,980 794,990 397,495 1,192,486 596,243 1,788,730 894,365 2,683,096 1,341,548 670,774 335,387 1,006,162 503,081 1,509,244 754,622 377,311 1,131,934 565,967 1,697,902 848,951 2,546,854 1,273,427 3,820,282 1,910,141 5,730,424 2,865,212 1,432,606 716,303 2,148,910 1,074,455 3,223,366 1,611,683 4,835,050 2,417,525 7,252,576 3,626,288 1,813,144 906,572 453,286 226,643 679,930 339,965

← Previous Integer #8,933,519 Browse Full Index Next Integer #8,933,521 →