1,664,532

2² × 3² × 46237

1,664,532 factors as 2^2 × 3^2 × 46237. Its 18 positive divisors give a proper-divisor sum of 2,543,126, so this integer is abundant. The Collatz stopping time is 132 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 46237

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 18

Divisor Sum (σ) 4,207,658

Proper Divisor Sum 2,543,126

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #1664501 ← → #1664543

Radix Representation

Decimal	1664532
Binary	110010110011000010100 (21 bits)
Octal	0o6263024
Hexadecimal	0x196614

Divisor Catalog (18)

1 2 3 4 6 9 12 18 36 46,237 92,474 138,711 184,948 277,422 416,133 554,844 832,266 1,664,532

Collatz Trajectory (132 steps to reach 1)

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

1,664,532 832,266 416,133 1,248,400 624,200 312,100 156,050 78,025 234,076 117,038 58,519 175,558 87,779 263,338 131,669 395,008 197,504 98,752 49,376 24,688 12,344 6,172 3,086 1,543 4,630 2,315 6,946 3,473 10,420 5,210 2,605 7,816 3,908 1,954 977 2,932 1,466 733 2,200 1,100 550 275 826 413 1,240 620 310 155 466 233 700 350 175 526 263 790 395 1,186 593 1,780

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,664,531 Browse Full Index Next Integer #1,664,533 →