552,162

2 × 3 × 13 × 7079

552,162 factors as 2 × 3 × 13 × 7079. Its 16 positive divisors give a proper-divisor sum of 637,278, so this integer is abundant. The Collatz stopping time is 58 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 7079

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,189,440

Proper Divisor Sum 637,278

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #552137 ← → #552179

Radix Representation

Decimal	552162
Binary	10000110110011100010 (20 bits)
Octal	0o2066342
Hexadecimal	0x86CE2

Divisor Catalog (16)

1 2 3 6 13 26 39 78 7,079 14,158 21,237 42,474 92,027 184,054 276,081 552,162

Collatz Trajectory (58 steps to reach 1)

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

552,162 276,081 828,244 414,122 207,061 621,184 310,592 155,296 77,648 38,824 19,412 9,706 4,853 14,560 7,280 3,640 1,820 910 455 1,366 683 2,050 1,025 3,076 1,538 769 2,308 1,154 577 1,732 866 433 1,300 650 325 976 488 244 122 61 184 92 46 23 70 35 106 53 160 80 40 20 10 5 16 8 4 2 1

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #552,161 Browse Full Index Next Integer #552,163 →