1,464,366

2 × 3 × 61 × 4001

1,464,366 factors as 2 × 3 × 61 × 4001. Its 16 positive divisors give a proper-divisor sum of 1,513,122, so this integer is abundant. The Collatz stopping time is 62 steps.

Prime Factor Structure

Factorization String 2 × 3 × 61 × 4001

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 2,977,488

Proper Divisor Sum 1,513,122

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #1464343 ← → #1464371

Radix Representation

Decimal	1464366
Binary	101100101100000101110 (21 bits)
Octal	0o5454056
Hexadecimal	0x16582E

Divisor Catalog (16)

1 2 3 6 61 122 183 366 4,001 8,002 12,003 24,006 244,061 488,122 732,183 1,464,366

Collatz Trajectory (62 steps to reach 1)

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

1,464,366 732,183 2,196,550 1,098,275 3,294,826 1,647,413 4,942,240 2,471,120 1,235,560 617,780 308,890 154,445 463,336 231,668 115,834 57,917 173,752 86,876 43,438 21,719 65,158 32,579 97,738 48,869 146,608 73,304 36,652 18,326 9,163 27,490 13,745 41,236 20,618 10,309 30,928 15,464 7,732 3,866 1,933 5,800 2,900 1,450 725 2,176 1,088 544 272 136 68 34 17 52 26 13 40 20 10 5 16 8

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,464,365 Browse Full Index Next Integer #1,464,367 →