4,922,876

2² × 7 × 109 × 1613

4,922,876 factors as 2^2 × 7 × 109 × 1613. Its 24 positive divisors give a proper-divisor sum of 5,019,364, so this integer is abundant. The Collatz stopping time is 206 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 109 × 1613

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 9,942,240

Proper Divisor Sum 5,019,364

Digit Sum / Digital Root 38 (Root: 2)

Adjacent Primes #4922873 ← → #4922891

Radix Representation

Decimal	4922876
Binary	10010110001110111111100 (23 bits)
Octal	0o22616774
Hexadecimal	0x4B1DFC

Divisor Catalog (24)

1 2 4 7 14 28 109 218 436 763 1,526 1,613 3,052 3,226 6,452 11,291 22,582 45,164 175,817 351,634 703,268 1,230,719 2,461,438 4,922,876

Collatz Trajectory (206 steps to reach 1)

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

4,922,876 2,461,438 1,230,719 3,692,158 1,846,079 5,538,238 2,769,119 8,307,358 4,153,679 12,461,038 6,230,519 18,691,558 9,345,779 28,037,338 14,018,669 42,056,008 21,028,004 10,514,002 5,257,001 15,771,004 7,885,502 3,942,751 11,828,254 5,914,127 17,742,382 8,871,191 26,613,574 13,306,787 39,920,362 19,960,181 59,880,544 29,940,272 14,970,136 7,485,068 3,742,534 1,871,267 5,613,802 2,806,901 8,420,704 4,210,352 2,105,176 1,052,588 526,294 263,147 789,442 394,721 1,184,164 592,082 296,041 888,124 444,062 222,031 666,094 333,047 999,142 499,571 1,498,714 749,357 2,248,072 1,124,036

← Previous Integer #4,922,875 Browse Full Index Next Integer #4,922,877 →