4,602,540

2² × 3 × 5 × 79 × 971

4,602,540 factors as 2^2 × 3 × 5 × 79 × 971. Its 48 positive divisors give a proper-divisor sum of 8,461,140, so this integer is abundant. The Collatz stopping time is 162 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 5 × 79 × 971

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 13,063,680

Proper Divisor Sum 8,461,140

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #4602517 ← → #4602551

Radix Representation

Decimal	4602540
Binary	10001100011101010101100 (23 bits)
Octal	0o21435254
Hexadecimal	0x463AAC

Divisor Catalog (48)

1 2 3 4 5 6 10 12 15 20 30 60 79 158 237 316 395 474 790 948 971 1,185 1,580 1,942 2,370 2,913 3,884 4,740 4,855 5,826 9,710 11,652 14,565 19,420 29,130 58,260 76,709 153,418 230,127 306,836 383,545 460,254 767,090 920,508 1,150,635 1,534,180 2,301,270 4,602,540

Collatz Trajectory (162 steps to reach 1)

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

4,602,540 2,301,270 1,150,635 3,451,906 1,725,953 5,177,860 2,588,930 1,294,465 3,883,396 1,941,698 970,849 2,912,548 1,456,274 728,137 2,184,412 1,092,206 546,103 1,638,310 819,155 2,457,466 1,228,733 3,686,200 1,843,100 921,550 460,775 1,382,326 691,163 2,073,490 1,036,745 3,110,236 1,555,118 777,559 2,332,678 1,166,339 3,499,018 1,749,509 5,248,528 2,624,264 1,312,132 656,066 328,033 984,100 492,050 246,025 738,076 369,038 184,519 553,558 276,779 830,338 415,169 1,245,508 622,754 311,377 934,132 467,066 233,533 700,600 350,300 175,150

← Previous Integer #4,602,539 Browse Full Index Next Integer #4,602,541 →