4,800,510

2 × 3² × 5 × 11 × 13 × 373

4,800,510 factors as 2 × 3^2 × 5 × 11 × 13 × 373. Its 96 positive divisors give a proper-divisor sum of 9,902,178, so this integer is abundant. The Collatz stopping time is 281 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 5 × 11 × 13 × 373

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 96

Divisor Sum (σ) 14,702,688

Proper Divisor Sum 9,902,178

Digit Sum / Digital Root 18 (Root: 9)

Adjacent Primes #4800487 ← → #4800541

Radix Representation

Decimal	4800510
Binary	10010010011111111111110 (23 bits)
Octal	0o22237776
Hexadecimal	0x493FFE

Divisor Catalog (60 of 96)

1 2 3 5 6 9 10 11 13 15 18 22 26 30 33 39 45 55 65 66 78 90 99 110 117 130 143 165 195 198 234 286 330 373 390 429 495 585 715 746 858 990 1,119 1,170 1,287 1,430 1,865 2,145 2,238 2,574 3,357 3,730 4,103 4,290 4,849 5,595 6,435 6,714 8,206 9,698

Collatz Trajectory (281 steps to reach 1)

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

4,800,510 2,400,255 7,200,766 3,600,383 10,801,150 5,400,575 16,201,726 8,100,863 24,302,590 12,151,295 36,453,886 18,226,943 54,680,830 27,340,415 82,021,246 41,010,623 123,031,870 61,515,935 184,547,806 92,273,903 276,821,710 138,410,855 415,232,566 207,616,283 622,848,850 311,424,425 934,273,276 467,136,638 233,568,319 700,704,958 350,352,479 1,051,057,438 525,528,719 1,576,586,158 788,293,079 2,364,879,238 1,182,439,619 3,547,318,858 1,773,659,429 5,320,978,288 2,660,489,144 1,330,244,572 665,122,286 332,561,143 997,683,430 498,841,715 1,496,525,146 748,262,573 2,244,787,720 1,122,393,860 561,196,930 280,598,465 841,795,396 420,897,698 210,448,849 631,346,548 315,673,274 157,836,637 473,509,912 236,754,956

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,800,509 Browse Full Index Next Integer #4,800,511 →