4,748,670

2 × 3² × 5 × 19 × 2777

4,748,670 factors as 2 × 3^2 × 5 × 19 × 2777. Its 48 positive divisors give a proper-divisor sum of 8,252,370, so this integer is abundant. The Collatz stopping time is 175 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 5 × 19 × 2777

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 13,001,040

Proper Divisor Sum 8,252,370

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #4748647 ← → #4748683

Radix Representation

Decimal	4748670
Binary	10010000111010101111110 (23 bits)
Octal	0o22072576
Hexadecimal	0x48757E

Divisor Catalog (48)

1 2 3 5 6 9 10 15 18 19 30 38 45 57 90 95 114 171 190 285 342 570 855 1,710 2,777 5,554 8,331 13,885 16,662 24,993 27,770 41,655 49,986 52,763 83,310 105,526 124,965 158,289 249,930 263,815 316,578 474,867 527,630 791,445 949,734 1,582,890 2,374,335 4,748,670

Collatz Trajectory (175 steps to reach 1)

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

4,748,670 2,374,335 7,123,006 3,561,503 10,684,510 5,342,255 16,026,766 8,013,383 24,040,150 12,020,075 36,060,226 18,030,113 54,090,340 27,045,170 13,522,585 40,567,756 20,283,878 10,141,939 30,425,818 15,212,909 45,638,728 22,819,364 11,409,682 5,704,841 17,114,524 8,557,262 4,278,631 12,835,894 6,417,947 19,253,842 9,626,921 28,880,764 14,440,382 7,220,191 21,660,574 10,830,287 32,490,862 16,245,431 48,736,294 24,368,147 73,104,442 36,552,221 109,656,664 54,828,332 27,414,166 13,707,083 41,121,250 20,560,625 61,681,876 30,840,938 15,420,469 46,261,408 23,130,704 11,565,352 5,782,676 2,891,338 1,445,669 4,337,008 2,168,504 1,084,252

← Previous Integer #4,748,669 Browse Full Index Next Integer #4,748,671 →