1,048,008

2³ × 3 × 13 × 3359

1,048,008 factors as 2^3 × 3 × 13 × 3359. Its 32 positive divisors give a proper-divisor sum of 1,774,392, so this integer is abundant. The Collatz stopping time is 59 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 13 × 3359

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 2,822,400

Proper Divisor Sum 1,774,392

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #1048007 ← → #1048009

Radix Representation

Decimal	1048008
Binary	11111111110111001000 (20 bits)
Octal	0o3776710
Hexadecimal	0xFFDC8

Divisor Catalog (32)

1 2 3 4 6 8 12 13 24 26 39 52 78 104 156 312 3,359 6,718 10,077 13,436 20,154 26,872 40,308 43,667 80,616 87,334 131,001 174,668 262,002 349,336 524,004 1,048,008

Collatz Trajectory (59 steps to reach 1)

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

1,048,008 524,004 262,002 131,001 393,004 196,502 98,251 294,754 147,377 442,132 221,066 110,533 331,600 165,800 82,900 41,450 20,725 62,176 31,088 15,544 7,772 3,886 1,943 5,830 2,915 8,746 4,373 13,120 6,560 3,280 1,640 820 410 205 616 308 154 77 232 116 58 29 88 44 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1

← Previous Integer #1,048,007 Browse Full Index Next Integer #1,048,009 →