4,740,879

3 × 11 × 13 × 43 × 257

4,740,879 factors as 3 × 11 × 13 × 43 × 257. Its 32 positive divisors give a proper-divisor sum of 2,887,665, so this integer is deficient. The Collatz stopping time is 118 steps.

Prime Factor Structure

Factorization String 3 × 11 × 13 × 43 × 257

Distinct Prime Factors 5

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 7,628,544

Proper Divisor Sum 2,887,665

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #4740817 ← → #4740887

Radix Representation

Decimal	4740879
Binary	10010000101011100001111 (23 bits)
Octal	0o22053417
Hexadecimal	0x48570F

Divisor Catalog (32)

1 3 11 13 33 39 43 129 143 257 429 473 559 771 1,419 1,677 2,827 3,341 6,149 8,481 10,023 11,051 18,447 33,153 36,751 110,253 121,561 143,663 364,683 430,989 1,580,293 4,740,879

Collatz Trajectory (118 steps to reach 1)

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

4,740,879 14,222,638 7,111,319 21,333,958 10,666,979 32,000,938 16,000,469 48,001,408 24,000,704 12,000,352 6,000,176 3,000,088 1,500,044 750,022 375,011 1,125,034 562,517 1,687,552 843,776 421,888 210,944 105,472 52,736 26,368 13,184 6,592 3,296 1,648 824 412 206 103 310 155 466 233 700 350 175 526 263 790 395 1,186 593 1,780 890 445 1,336 668 334 167 502 251 754 377 1,132 566 283 850

← Previous Integer #4,740,878 Browse Full Index Next Integer #4,740,880 →