4,770,892

2² × 7 × 170389

4,770,892 factors as 2^2 × 7 × 170389. Its 12 positive divisors give a proper-divisor sum of 4,770,948, so this integer is abundant. The Collatz stopping time is 224 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 170389

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 9,541,840

Proper Divisor Sum 4,770,948

Digit Sum / Digital Root 37 (Root: 1)

Adjacent Primes #4770851 ← → #4770911

Radix Representation

Decimal	4770892
Binary	10010001100110001001100 (23 bits)
Octal	0o22146114
Hexadecimal	0x48CC4C

Divisor Catalog (12)

1 2 4 7 14 28 170,389 340,778 681,556 1,192,723 2,385,446 4,770,892

Collatz Trajectory (224 steps to reach 1)

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

4,770,892 2,385,446 1,192,723 3,578,170 1,789,085 5,367,256 2,683,628 1,341,814 670,907 2,012,722 1,006,361 3,019,084 1,509,542 754,771 2,264,314 1,132,157 3,396,472 1,698,236 849,118 424,559 1,273,678 636,839 1,910,518 955,259 2,865,778 1,432,889 4,298,668 2,149,334 1,074,667 3,224,002 1,612,001 4,836,004 2,418,002 1,209,001 3,627,004 1,813,502 906,751 2,720,254 1,360,127 4,080,382 2,040,191 6,120,574 3,060,287 9,180,862 4,590,431 13,771,294 6,885,647 20,656,942 10,328,471 30,985,414 15,492,707 46,478,122 23,239,061 69,717,184 34,858,592 17,429,296 8,714,648 4,357,324 2,178,662 1,089,331

← Previous Integer #4,770,891 Browse Full Index Next Integer #4,770,893 →