2,897,520

2⁴ × 3 × 5 × 12073

2,897,520 factors as 2^4 × 3 × 5 × 12073. Its 40 positive divisors give a proper-divisor sum of 6,085,536, so this integer is abundant. The Collatz stopping time is 107 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 5 × 12073

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 8,983,056

Proper Divisor Sum 6,085,536

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #2897501 ← → #2897527

Radix Representation

Decimal	2897520
Binary	1011000011011001110000 (22 bits)
Octal	0o13033160
Hexadecimal	0x2C3670

Divisor Catalog (40)

1 2 3 4 5 6 8 10 12 15 16 20 24 30 40 48 60 80 120 240 12,073 24,146 36,219 48,292 60,365 72,438 96,584 120,730 144,876 181,095 193,168 241,460 289,752 362,190 482,920 579,504 724,380 965,840 1,448,760 2,897,520

Collatz Trajectory (107 steps to reach 1)

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

2,897,520 1,448,760 724,380 362,190 181,095 543,286 271,643 814,930 407,465 1,222,396 611,198 305,599 916,798 458,399 1,375,198 687,599 2,062,798 1,031,399 3,094,198 1,547,099 4,641,298 2,320,649 6,961,948 3,480,974 1,740,487 5,221,462 2,610,731 7,832,194 3,916,097 11,748,292 5,874,146 2,937,073 8,811,220 4,405,610 2,202,805 6,608,416 3,304,208 1,652,104 826,052 413,026 206,513 619,540 309,770 154,885 464,656 232,328 116,164 58,082 29,041 87,124 43,562 21,781 65,344 32,672 16,336 8,168 4,084 2,042 1,021 3,064

← Previous Integer #2,897,519 Browse Full Index Next Integer #2,897,521 →