2,912,001

3 × 970667

2,912,001 factors as 3 × 970667. Its 4 positive divisors give a proper-divisor sum of 970,671, so this integer is deficient. The Collatz stopping time is 213 steps.

Prime Factor Structure

Factorization String 3 × 970667

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 3,882,672

Proper Divisor Sum 970,671

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #2911973 ← → #2912009

Radix Representation

Decimal	2912001
Binary	1011000110111100000001 (22 bits)
Octal	0o13067401
Hexadecimal	0x2C6F01

Divisor Catalog (4)

1 3 970,667 2,912,001

Collatz Trajectory (213 steps to reach 1)

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

2,912,001 8,736,004 4,368,002 2,184,001 6,552,004 3,276,002 1,638,001 4,914,004 2,457,002 1,228,501 3,685,504 1,842,752 921,376 460,688 230,344 115,172 57,586 28,793 86,380 43,190 21,595 64,786 32,393 97,180 48,590 24,295 72,886 36,443 109,330 54,665 163,996 81,998 40,999 122,998 61,499 184,498 92,249 276,748 138,374 69,187 207,562 103,781 311,344 155,672 77,836 38,918 19,459 58,378 29,189 87,568 43,784 21,892 10,946 5,473 16,420 8,210 4,105 12,316 6,158 3,079

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,912,000 Browse Full Index Next Integer #2,912,002 →