1,459,464

2³ × 3 × 60811

1,459,464 factors as 2^3 × 3 × 60811. Its 16 positive divisors give a proper-divisor sum of 2,189,256, so this integer is abundant. The Collatz stopping time is 168 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 60811

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 3,648,720

Proper Divisor Sum 2,189,256

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #1459457 ← → #1459481

Radix Representation

Decimal	1459464
Binary	101100100010100001000 (21 bits)
Octal	0o5442410
Hexadecimal	0x164508

Divisor Catalog (16)

1 2 3 4 6 8 12 24 60,811 121,622 182,433 243,244 364,866 486,488 729,732 1,459,464

Collatz Trajectory (168 steps to reach 1)

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

1,459,464 729,732 364,866 182,433 547,300 273,650 136,825 410,476 205,238 102,619 307,858 153,929 461,788 230,894 115,447 346,342 173,171 519,514 259,757 779,272 389,636 194,818 97,409 292,228 146,114 73,057 219,172 109,586 54,793 164,380 82,190 41,095 123,286 61,643 184,930 92,465 277,396 138,698 69,349 208,048 104,024 52,012 26,006 13,003 39,010 19,505 58,516 29,258 14,629 43,888 21,944 10,972 5,486 2,743 8,230 4,115 12,346 6,173 18,520 9,260

← Previous Integer #1,459,463 Browse Full Index Next Integer #1,459,465 →