4,757,480

2³ × 5 × 7 × 13 × 1307

4,757,480 factors as 2^3 × 5 × 7 × 13 × 1307. Its 64 positive divisors give a proper-divisor sum of 8,427,160, so this integer is abundant. The Collatz stopping time is 100 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 7 × 13 × 1307

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 13,184,640

Proper Divisor Sum 8,427,160

Digit Sum / Digital Root 35 (Root: 8)

Adjacent Primes #4757471 ← → #4757491

Radix Representation

Decimal	4757480
Binary	10010001001011111101000 (23 bits)
Octal	0o22113750
Hexadecimal	0x4897E8

Divisor Catalog (60 of 64)

1 2 4 5 7 8 10 13 14 20 26 28 35 40 52 56 65 70 91 104 130 140 182 260 280 364 455 520 728 910 1,307 1,820 2,614 3,640 5,228 6,535 9,149 10,456 13,070 16,991 18,298 26,140 33,982 36,596 45,745 52,280 67,964 73,192 84,955 91,490 118,937 135,928 169,910 182,980 237,874 339,820 365,960 475,748 594,685 679,640

Collatz Trajectory (100 steps to reach 1)

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

4,757,480 2,378,740 1,189,370 594,685 1,784,056 892,028 446,014 223,007 669,022 334,511 1,003,534 501,767 1,505,302 752,651 2,257,954 1,128,977 3,386,932 1,693,466 846,733 2,540,200 1,270,100 635,050 317,525 952,576 476,288 238,144 119,072 59,536 29,768 14,884 7,442 3,721 11,164 5,582 2,791 8,374 4,187 12,562 6,281 18,844 9,422 4,711 14,134 7,067 21,202 10,601 31,804 15,902 7,951 23,854 11,927 35,782 17,891 53,674 26,837 80,512 40,256 20,128 10,064 5,032

← Previous Integer #4,757,479 Browse Full Index Next Integer #4,757,481 →