4,746,224

2⁴ × 7 × 31 × 1367

4,746,224 factors as 2^4 × 7 × 31 × 1367. Its 40 positive divisors give a proper-divisor sum of 6,110,224, so this integer is abundant. The Collatz stopping time is 162 steps.

Prime Factor Structure

Factorization String 2^4 × 7 × 31 × 1367

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 10,856,448

Proper Divisor Sum 6,110,224

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #4746191 ← → #4746229

Radix Representation

Decimal	4746224
Binary	10010000110101111110000 (23 bits)
Octal	0o22065760
Hexadecimal	0x486BF0

Divisor Catalog (40)

1 2 4 7 8 14 16 28 31 56 62 112 124 217 248 434 496 868 1,367 1,736 2,734 3,472 5,468 9,569 10,936 19,138 21,872 38,276 42,377 76,552 84,754 153,104 169,508 296,639 339,016 593,278 678,032 1,186,556 2,373,112 4,746,224

Collatz Trajectory (162 steps to reach 1)

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

4,746,224 2,373,112 1,186,556 593,278 296,639 889,918 444,959 1,334,878 667,439 2,002,318 1,001,159 3,003,478 1,501,739 4,505,218 2,252,609 6,757,828 3,378,914 1,689,457 5,068,372 2,534,186 1,267,093 3,801,280 1,900,640 950,320 475,160 237,580 118,790 59,395 178,186 89,093 267,280 133,640 66,820 33,410 16,705 50,116 25,058 12,529 37,588 18,794 9,397 28,192 14,096 7,048 3,524 1,762 881 2,644 1,322 661 1,984 992 496 248 124 62 31 94 47 142

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