4,995,608

2³ × 624451

4,995,608 factors as 2^3 × 624451. Its 8 positive divisors give a proper-divisor sum of 4,371,172, so this integer is deficient. The Collatz stopping time is 162 steps.

Prime Factor Structure

Factorization String 2^3 × 624451

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 9,366,780

Proper Divisor Sum 4,371,172

Digit Sum / Digital Root 41 (Root: 5)

Adjacent Primes #4995607 ← → #4995643

Radix Representation

Decimal	4995608
Binary	10011000011101000011000 (23 bits)
Octal	0o23035030
Hexadecimal	0x4C3A18

Divisor Catalog (8)

1 2 4 8 624,451 1,248,902 2,497,804 4,995,608

Collatz Trajectory (162 steps to reach 1)

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

4,995,608 2,497,804 1,248,902 624,451 1,873,354 936,677 2,810,032 1,405,016 702,508 351,254 175,627 526,882 263,441 790,324 395,162 197,581 592,744 296,372 148,186 74,093 222,280 111,140 55,570 27,785 83,356 41,678 20,839 62,518 31,259 93,778 46,889 140,668 70,334 35,167 105,502 52,751 158,254 79,127 237,382 118,691 356,074 178,037 534,112 267,056 133,528 66,764 33,382 16,691 50,074 25,037 75,112 37,556 18,778 9,389 28,168 14,084 7,042 3,521 10,564 5,282

← Previous Integer #4,995,607 Browse Full Index Next Integer #4,995,609 →