1,142,970

2 × 3 × 5 × 31 × 1229

1,142,970 factors as 2 × 3 × 5 × 31 × 1229. Its 32 positive divisors give a proper-divisor sum of 1,690,950, so this integer is abundant. The Collatz stopping time is 54 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 31 × 1229

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 2,833,920

Proper Divisor Sum 1,690,950

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #1142969 ← → #1142971

Radix Representation

Decimal	1142970
Binary	100010111000010111010 (21 bits)
Octal	0o4270272
Hexadecimal	0x1170BA

Divisor Catalog (32)

1 2 3 5 6 10 15 30 31 62 93 155 186 310 465 930 1,229 2,458 3,687 6,145 7,374 12,290 18,435 36,870 38,099 76,198 114,297 190,495 228,594 380,990 571,485 1,142,970

Collatz Trajectory (54 steps to reach 1)

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

1,142,970 571,485 1,714,456 857,228 428,614 214,307 642,922 321,461 964,384 482,192 241,096 120,548 60,274 30,137 90,412 45,206 22,603 67,810 33,905 101,716 50,858 25,429 76,288 38,144 19,072 9,536 4,768 2,384 1,192 596 298 149 448 224 112 56 28 14 7 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1

← Previous Integer #1,142,969 Browse Full Index Next Integer #1,142,971 →