4,642,002

2 × 3³ × 31 × 47 × 59

4,642,002 factors as 2 × 3^3 × 31 × 47 × 59. Its 64 positive divisors give a proper-divisor sum of 6,417,198, so this integer is abundant. The Collatz stopping time is 87 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 31 × 47 × 59

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 11,059,200

Proper Divisor Sum 6,417,198

Digit Sum / Digital Root 18 (Root: 9)

Adjacent Primes #4641991 ← → #4642009

Radix Representation

Decimal	4642002
Binary	10001101101010011010010 (23 bits)
Octal	0o21552322
Hexadecimal	0x46D4D2

Divisor Catalog (60 of 64)

1 2 3 6 9 18 27 31 47 54 59 62 93 94 118 141 177 186 279 282 354 423 531 558 837 846 1,062 1,269 1,457 1,593 1,674 1,829 2,538 2,773 2,914 3,186 3,658 4,371 5,487 5,546 8,319 8,742 10,974 13,113 16,461 16,638 24,957 26,226 32,922 39,339 49,383 49,914 74,871 78,678 85,963 98,766 149,742 171,926 257,889 515,778

Collatz Trajectory (87 steps to reach 1)

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

4,642,002 2,321,001 6,963,004 3,481,502 1,740,751 5,222,254 2,611,127 7,833,382 3,916,691 11,750,074 5,875,037 17,625,112 8,812,556 4,406,278 2,203,139 6,609,418 3,304,709 9,914,128 4,957,064 2,478,532 1,239,266 619,633 1,858,900 929,450 464,725 1,394,176 697,088 348,544 174,272 87,136 43,568 21,784 10,892 5,446 2,723 8,170 4,085 12,256 6,128 3,064 1,532 766 383 1,150 575 1,726 863 2,590 1,295 3,886 1,943 5,830 2,915 8,746 4,373 13,120 6,560 3,280 1,640 820

← Previous Integer #4,642,001 Browse Full Index Next Integer #4,642,003 →