5,569,470

2 × 3² × 5 × 19 × 3257

5,569,470 factors as 2 × 3^2 × 5 × 19 × 3257. Its 48 positive divisors give a proper-divisor sum of 9,677,970, so this integer is abundant. The Collatz stopping time is 232 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 5 × 19 × 3257

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 15,247,440

Proper Divisor Sum 9,677,970

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #5569463 ← → #5569477

Radix Representation

Decimal	5569470
Binary	10101001111101110111110 (23 bits)
Octal	0o25175676
Hexadecimal	0x54FBBE

Divisor Catalog (48)

1 2 3 5 6 9 10 15 18 19 30 38 45 57 90 95 114 171 190 285 342 570 855 1,710 3,257 6,514 9,771 16,285 19,542 29,313 32,570 48,855 58,626 61,883 97,710 123,766 146,565 185,649 293,130 309,415 371,298 556,947 618,830 928,245 1,113,894 1,856,490 2,784,735 5,569,470

Collatz Trajectory (232 steps to reach 1)

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

5,569,470 2,784,735 8,354,206 4,177,103 12,531,310 6,265,655 18,796,966 9,398,483 28,195,450 14,097,725 42,293,176 21,146,588 10,573,294 5,286,647 15,859,942 7,929,971 23,789,914 11,894,957 35,684,872 17,842,436 8,921,218 4,460,609 13,381,828 6,690,914 3,345,457 10,036,372 5,018,186 2,509,093 7,527,280 3,763,640 1,881,820 940,910 470,455 1,411,366 705,683 2,117,050 1,058,525 3,175,576 1,587,788 793,894 396,947 1,190,842 595,421 1,786,264 893,132 446,566 223,283 669,850 334,925 1,004,776 502,388 251,194 125,597 376,792 188,396 94,198 47,099 141,298 70,649 211,948

← Previous Integer #5,569,469 Browse Full Index Next Integer #5,569,471 →