2,146,575

3 × 5² × 28621

2,146,575 factors as 3 × 5^2 × 28621. Its 12 positive divisors give a proper-divisor sum of 1,402,553, so this integer is deficient. The Collatz stopping time is 166 steps.

Prime Factor Structure

Factorization String 3 × 5^2 × 28621

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 3,549,128

Proper Divisor Sum 1,402,553

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #2146561 ← → #2146589

Radix Representation

Decimal	2146575
Binary	1000001100000100001111 (22 bits)
Octal	0o10140417
Hexadecimal	0x20C10F

Divisor Catalog (12)

1 3 5 15 25 75 28,621 85,863 143,105 429,315 715,525 2,146,575

Collatz Trajectory (166 steps to reach 1)

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

2,146,575 6,439,726 3,219,863 9,659,590 4,829,795 14,489,386 7,244,693 21,734,080 10,867,040 5,433,520 2,716,760 1,358,380 679,190 339,595 1,018,786 509,393 1,528,180 764,090 382,045 1,146,136 573,068 286,534 143,267 429,802 214,901 644,704 322,352 161,176 80,588 40,294 20,147 60,442 30,221 90,664 45,332 22,666 11,333 34,000 17,000 8,500 4,250 2,125 6,376 3,188 1,594 797 2,392 1,196 598 299 898 449 1,348 674 337 1,012 506 253 760 380

← Previous Integer #2,146,574 Browse Full Index Next Integer #2,146,576 →