1,405,554

2 × 3 × 234259

1,405,554 factors as 2 × 3 × 234259. Its 8 positive divisors give a proper-divisor sum of 1,405,566, so this integer is abundant. The Collatz stopping time is 106 steps.

Prime Factor Structure

Factorization String 2 × 3 × 234259

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 2,811,120

Proper Divisor Sum 1,405,566

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #1405531 ← → #1405561

Radix Representation

Decimal	1405554
Binary	101010111001001110010 (21 bits)
Octal	0o5271162
Hexadecimal	0x157272

Divisor Catalog (8)

1 2 3 6 234,259 468,518 702,777 1,405,554

Collatz Trajectory (106 steps to reach 1)

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

1,405,554 702,777 2,108,332 1,054,166 527,083 1,581,250 790,625 2,371,876 1,185,938 592,969 1,778,908 889,454 444,727 1,334,182 667,091 2,001,274 1,000,637 3,001,912 1,500,956 750,478 375,239 1,125,718 562,859 1,688,578 844,289 2,532,868 1,266,434 633,217 1,899,652 949,826 474,913 1,424,740 712,370 356,185 1,068,556 534,278 267,139 801,418 400,709 1,202,128 601,064 300,532 150,266 75,133 225,400 112,700 56,350 28,175 84,526 42,263 126,790 63,395 190,186 95,093 285,280 142,640 71,320 35,660 17,830 8,915

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,405,553 Browse Full Index Next Integer #1,405,555 →