5,647,272

2³ × 3 × 167 × 1409

5,647,272 factors as 2^3 × 3 × 167 × 1409. Its 32 positive divisors give a proper-divisor sum of 8,565,528, so this integer is abundant. The Collatz stopping time is 170 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 167 × 1409

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 14,212,800

Proper Divisor Sum 8,565,528

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #5647267 ← → #5647307

Radix Representation

Decimal	5647272
Binary	10101100010101110101000 (23 bits)
Octal	0o25425650
Hexadecimal	0x562BA8

Divisor Catalog (32)

1 2 3 4 6 8 12 24 167 334 501 668 1,002 1,336 1,409 2,004 2,818 4,008 4,227 5,636 8,454 11,272 16,908 33,816 235,303 470,606 705,909 941,212 1,411,818 1,882,424 2,823,636 5,647,272

Collatz Trajectory (170 steps to reach 1)

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

5,647,272 2,823,636 1,411,818 705,909 2,117,728 1,058,864 529,432 264,716 132,358 66,179 198,538 99,269 297,808 148,904 74,452 37,226 18,613 55,840 27,920 13,960 6,980 3,490 1,745 5,236 2,618 1,309 3,928 1,964 982 491 1,474 737 2,212 1,106 553 1,660 830 415 1,246 623 1,870 935 2,806 1,403 4,210 2,105 6,316 3,158 1,579 4,738 2,369 7,108 3,554 1,777 5,332 2,666 1,333 4,000 2,000 1,000

← Previous Integer #5,647,271 Browse Full Index Next Integer #5,647,273 →