1,604,412

2² × 3² × 41 × 1087

1,604,412 factors as 2^2 × 3^2 × 41 × 1087. Its 36 positive divisors give a proper-divisor sum of 2,553,924, so this integer is abundant. The Collatz stopping time is 238 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 41 × 1087

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 4,158,336

Proper Divisor Sum 2,553,924

Digit Sum / Digital Root 18 (Root: 9)

Adjacent Primes #1604399 ← → #1604413

Radix Representation

Decimal	1604412
Binary	110000111101100111100 (21 bits)
Octal	0o6075474
Hexadecimal	0x187B3C

Divisor Catalog (36)

1 2 3 4 6 9 12 18 36 41 82 123 164 246 369 492 738 1,087 1,476 2,174 3,261 4,348 6,522 9,783 13,044 19,566 39,132 44,567 89,134 133,701 178,268 267,402 401,103 534,804 802,206 1,604,412

Collatz Trajectory (238 steps to reach 1)

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

1,604,412 802,206 401,103 1,203,310 601,655 1,804,966 902,483 2,707,450 1,353,725 4,061,176 2,030,588 1,015,294 507,647 1,522,942 761,471 2,284,414 1,142,207 3,426,622 1,713,311 5,139,934 2,569,967 7,709,902 3,854,951 11,564,854 5,782,427 17,347,282 8,673,641 26,020,924 13,010,462 6,505,231 19,515,694 9,757,847 29,273,542 14,636,771 43,910,314 21,955,157 65,865,472 32,932,736 16,466,368 8,233,184 4,116,592 2,058,296 1,029,148 514,574 257,287 771,862 385,931 1,157,794 578,897 1,736,692 868,346 434,173 1,302,520 651,260 325,630 162,815 488,446 244,223 732,670 366,335

← Previous Integer #1,604,411 Browse Full Index Next Integer #1,604,413 →