5,074,760

2³ × 5 × 293 × 433

5,074,760 factors as 2^3 × 5 × 293 × 433. Its 32 positive divisors give a proper-divisor sum of 6,408,880, so this integer is abundant. The Collatz stopping time is 105 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 293 × 433

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 11,483,640

Proper Divisor Sum 6,408,880

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #5074753 ← → #5074777

Radix Representation

Decimal	5074760
Binary	10011010110111101001000 (23 bits)
Octal	0o23267510
Hexadecimal	0x4D6F48

Divisor Catalog (32)

1 2 4 5 8 10 20 40 293 433 586 866 1,172 1,465 1,732 2,165 2,344 2,930 3,464 4,330 5,860 8,660 11,720 17,320 126,869 253,738 507,476 634,345 1,014,952 1,268,690 2,537,380 5,074,760

Collatz Trajectory (105 steps to reach 1)

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

5,074,760 2,537,380 1,268,690 634,345 1,903,036 951,518 475,759 1,427,278 713,639 2,140,918 1,070,459 3,211,378 1,605,689 4,817,068 2,408,534 1,204,267 3,612,802 1,806,401 5,419,204 2,709,602 1,354,801 4,064,404 2,032,202 1,016,101 3,048,304 1,524,152 762,076 381,038 190,519 571,558 285,779 857,338 428,669 1,286,008 643,004 321,502 160,751 482,254 241,127 723,382 361,691 1,085,074 542,537 1,627,612 813,806 406,903 1,220,710 610,355 1,831,066 915,533 2,746,600 1,373,300 686,650 343,325 1,029,976 514,988 257,494 128,747 386,242 193,121

← Previous Integer #5,074,759 Browse Full Index Next Integer #5,074,761 →