1,552,062

2 × 3 × 258677

1,552,062 factors as 2 × 3 × 258677. Its 8 positive divisors give a proper-divisor sum of 1,552,074, so this integer is abundant. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 2 × 3 × 258677

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 3,104,136

Proper Divisor Sum 1,552,074

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #1552037 ← → #1552079

Radix Representation

Decimal	1552062
Binary	101111010111010111110 (21 bits)
Octal	0o5727276
Hexadecimal	0x17AEBE

Divisor Catalog (8)

1 2 3 6 258,677 517,354 776,031 1,552,062

Collatz Trajectory (88 steps to reach 1)

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

1,552,062 776,031 2,328,094 1,164,047 3,492,142 1,746,071 5,238,214 2,619,107 7,857,322 3,928,661 11,785,984 5,892,992 2,946,496 1,473,248 736,624 368,312 184,156 92,078 46,039 138,118 69,059 207,178 103,589 310,768 155,384 77,692 38,846 19,423 58,270 29,135 87,406 43,703 131,110 65,555 196,666 98,333 295,000 147,500 73,750 36,875 110,626 55,313 165,940 82,970 41,485 124,456 62,228 31,114 15,557 46,672 23,336 11,668 5,834 2,917 8,752 4,376 2,188 1,094 547 1,642

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,552,061 Browse Full Index Next Integer #1,552,063 →