4,809,696

2⁵ × 3 × 50101

4,809,696 factors as 2^5 × 3 × 50101. Its 24 positive divisors give a proper-divisor sum of 7,816,008, so this integer is abundant. The Collatz stopping time is 74 steps.

Prime Factor Structure

Factorization String 2^5 × 3 × 50101

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 12,625,704

Proper Divisor Sum 7,816,008

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #4809689 ← → #4809703

Radix Representation

Decimal	4809696
Binary	10010010110001111100000 (23 bits)
Octal	0o22261740
Hexadecimal	0x4963E0

Divisor Catalog (24)

1 2 3 4 6 8 12 16 24 32 48 96 50,101 100,202 150,303 200,404 300,606 400,808 601,212 801,616 1,202,424 1,603,232 2,404,848 4,809,696

Collatz Trajectory (74 steps to reach 1)

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

4,809,696 2,404,848 1,202,424 601,212 300,606 150,303 450,910 225,455 676,366 338,183 1,014,550 507,275 1,521,826 760,913 2,282,740 1,141,370 570,685 1,712,056 856,028 428,014 214,007 642,022 321,011 963,034 481,517 1,444,552 722,276 361,138 180,569 541,708 270,854 135,427 406,282 203,141 609,424 304,712 152,356 76,178 38,089 114,268 57,134 28,567 85,702 42,851 128,554 64,277 192,832 96,416 48,208 24,104 12,052 6,026 3,013 9,040 4,520 2,260 1,130 565 1,696 848

← Previous Integer #4,809,695 Browse Full Index Next Integer #4,809,697 →