1,168,554

2 × 3 × 59 × 3301

1,168,554 factors as 2 × 3 × 59 × 3301. Its 16 positive divisors give a proper-divisor sum of 1,208,886, so this integer is abundant. The Collatz stopping time is 72 steps.

Prime Factor Structure

Factorization String 2 × 3 × 59 × 3301

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 2,377,440

Proper Divisor Sum 1,208,886

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #1168553 ← → #1168619

Radix Representation

Decimal	1168554
Binary	100011101010010101010 (21 bits)
Octal	0o4352252
Hexadecimal	0x11D4AA

Divisor Catalog (16)

1 2 3 6 59 118 177 354 3,301 6,602 9,903 19,806 194,759 389,518 584,277 1,168,554

Collatz Trajectory (72 steps to reach 1)

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

1,168,554 584,277 1,752,832 876,416 438,208 219,104 109,552 54,776 27,388 13,694 6,847 20,542 10,271 30,814 15,407 46,222 23,111 69,334 34,667 104,002 52,001 156,004 78,002 39,001 117,004 58,502 29,251 87,754 43,877 131,632 65,816 32,908 16,454 8,227 24,682 12,341 37,024 18,512 9,256 4,628 2,314 1,157 3,472 1,736 868 434 217 652 326 163 490 245 736 368 184 92 46 23 70 35

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,168,553 Browse Full Index Next Integer #1,168,555 →