4,087,224

2³ × 3² × 56767

4,087,224 factors as 2^3 × 3^2 × 56767. Its 24 positive divisors give a proper-divisor sum of 6,982,536, so this integer is abundant. The Collatz stopping time is 105 steps.

Prime Factor Structure

Factorization String 2^3 × 3^2 × 56767

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 11,069,760

Proper Divisor Sum 6,982,536

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #4087217 ← → #4087229

Radix Representation

Decimal	4087224
Binary	1111100101110110111000 (22 bits)
Octal	0o17456670
Hexadecimal	0x3E5DB8

Divisor Catalog (24)

1 2 3 4 6 8 9 12 18 24 36 72 56,767 113,534 170,301 227,068 340,602 454,136 510,903 681,204 1,021,806 1,362,408 2,043,612 4,087,224

Collatz Trajectory (105 steps to reach 1)

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

4,087,224 2,043,612 1,021,806 510,903 1,532,710 766,355 2,299,066 1,149,533 3,448,600 1,724,300 862,150 431,075 1,293,226 646,613 1,939,840 969,920 484,960 242,480 121,240 60,620 30,310 15,155 45,466 22,733 68,200 34,100 17,050 8,525 25,576 12,788 6,394 3,197 9,592 4,796 2,398 1,199 3,598 1,799 5,398 2,699 8,098 4,049 12,148 6,074 3,037 9,112 4,556 2,278 1,139 3,418 1,709 5,128 2,564 1,282 641 1,924 962 481 1,444 722

← Previous Integer #4,087,223 Browse Full Index Next Integer #4,087,225 →