4,233,560

2³ × 5 × 109 × 971

4,233,560 factors as 2^3 × 5 × 109 × 971. Its 32 positive divisors give a proper-divisor sum of 5,389,240, so this integer is abundant. The Collatz stopping time is 198 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 109 × 971

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 9,622,800

Proper Divisor Sum 5,389,240

Digit Sum / Digital Root 23 (Root: 5)

Adjacent Primes #4233553 ← → #4233563

Radix Representation

Decimal	4233560
Binary	10000001001100101011000 (23 bits)
Octal	0o20114530
Hexadecimal	0x409958

Divisor Catalog (32)

1 2 4 5 8 10 20 40 109 218 436 545 872 971 1,090 1,942 2,180 3,884 4,360 4,855 7,768 9,710 19,420 38,840 105,839 211,678 423,356 529,195 846,712 1,058,390 2,116,780 4,233,560

Collatz Trajectory (198 steps to reach 1)

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

4,233,560 2,116,780 1,058,390 529,195 1,587,586 793,793 2,381,380 1,190,690 595,345 1,786,036 893,018 446,509 1,339,528 669,764 334,882 167,441 502,324 251,162 125,581 376,744 188,372 94,186 47,093 141,280 70,640 35,320 17,660 8,830 4,415 13,246 6,623 19,870 9,935 29,806 14,903 44,710 22,355 67,066 33,533 100,600 50,300 25,150 12,575 37,726 18,863 56,590 28,295 84,886 42,443 127,330 63,665 190,996 95,498 47,749 143,248 71,624 35,812 17,906 8,953 26,860

← Previous Integer #4,233,559 Browse Full Index Next Integer #4,233,561 →