4,866,468

2² × 3 × 283 × 1433

4,866,468 factors as 2^2 × 3 × 283 × 1433. Its 24 positive divisors give a proper-divisor sum of 6,536,700, so this integer is abundant. The Collatz stopping time is 162 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 283 × 1433

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 11,403,168

Proper Divisor Sum 6,536,700

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #4866443 ← → #4866469

Radix Representation

Decimal	4866468
Binary	10010100100000110100100 (23 bits)
Octal	0o22440644
Hexadecimal	0x4A41A4

Divisor Catalog (24)

Collatz Trajectory (162 steps to reach 1)

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

4,866,468 2,433,234 1,216,617 3,649,852 1,824,926 912,463 2,737,390 1,368,695 4,106,086 2,053,043 6,159,130 3,079,565 9,238,696 4,619,348 2,309,674 1,154,837 3,464,512 1,732,256 866,128 433,064 216,532 108,266 54,133 162,400 81,200 40,600 20,300 10,150 5,075 15,226 7,613 22,840 11,420 5,710 2,855 8,566 4,283 12,850 6,425 19,276 9,638 4,819 14,458 7,229 21,688 10,844 5,422 2,711 8,134 4,067 12,202 6,101 18,304 9,152 4,576 2,288 1,144 572 286 143

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,866,467 Browse Full Index Next Integer #4,866,469 →