5,341,992

2³ × 3 × 103 × 2161

5,341,992 factors as 2^3 × 3 × 103 × 2161. Its 32 positive divisors give a proper-divisor sum of 8,148,888, so this integer is abundant. The Collatz stopping time is 170 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 103 × 2161

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 13,490,880

Proper Divisor Sum 8,148,888

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #5341979 ← → #5341993

Radix Representation

Decimal	5341992
Binary	10100011000001100101000 (23 bits)
Octal	0o24301450
Hexadecimal	0x518328

Divisor Catalog (32)

1 2 3 4 6 8 12 24 103 206 309 412 618 824 1,236 2,161 2,472 4,322 6,483 8,644 12,966 17,288 25,932 51,864 222,583 445,166 667,749 890,332 1,335,498 1,780,664 2,670,996 5,341,992

Collatz Trajectory (170 steps to reach 1)

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

5,341,992 2,670,996 1,335,498 667,749 2,003,248 1,001,624 500,812 250,406 125,203 375,610 187,805 563,416 281,708 140,854 70,427 211,282 105,641 316,924 158,462 79,231 237,694 118,847 356,542 178,271 534,814 267,407 802,222 401,111 1,203,334 601,667 1,805,002 902,501 2,707,504 1,353,752 676,876 338,438 169,219 507,658 253,829 761,488 380,744 190,372 95,186 47,593 142,780 71,390 35,695 107,086 53,543 160,630 80,315 240,946 120,473 361,420 180,710 90,355 271,066 135,533 406,600 203,300

← Previous Integer #5,341,991 Browse Full Index Next Integer #5,341,993 →