4,813,524

2² × 3² × 133709

4,813,524 factors as 2^2 × 3^2 × 133709. Its 18 positive divisors give a proper-divisor sum of 7,354,086, so this integer is abundant. The Collatz stopping time is 162 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 133709

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 18

Divisor Sum (σ) 12,167,610

Proper Divisor Sum 7,354,086

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #4813511 ← → #4813531

Radix Representation

Decimal	4813524
Binary	10010010111001011010100 (23 bits)
Octal	0o22271324
Hexadecimal	0x4972D4

Divisor Catalog (18)

1 2 3 4 6 9 12 18 36 133,709 267,418 401,127 534,836 802,254 1,203,381 1,604,508 2,406,762 4,813,524

Collatz Trajectory (162 steps to reach 1)

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

4,813,524 2,406,762 1,203,381 3,610,144 1,805,072 902,536 451,268 225,634 112,817 338,452 169,226 84,613 253,840 126,920 63,460 31,730 15,865 47,596 23,798 11,899 35,698 17,849 53,548 26,774 13,387 40,162 20,081 60,244 30,122 15,061 45,184 22,592 11,296 5,648 2,824 1,412 706 353 1,060 530 265 796 398 199 598 299 898 449 1,348 674 337 1,012 506 253 760 380 190 95 286 143

← Previous Integer #4,813,523 Browse Full Index Next Integer #4,813,525 →