4,716,296

2³ × 13 × 101 × 449

4,716,296 factors as 2^3 × 13 × 101 × 449. Its 32 positive divisors give a proper-divisor sum of 4,922,704, so this integer is abundant. The Collatz stopping time is 131 steps.

Prime Factor Structure

Factorization String 2^3 × 13 × 101 × 449

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 9,639,000

Proper Divisor Sum 4,922,704

Digit Sum / Digital Root 35 (Root: 8)

Adjacent Primes #4716289 ← → #4716301

Radix Representation

Decimal	4716296
Binary	10001111111011100001000 (23 bits)
Octal	0o21773410
Hexadecimal	0x47F708

Divisor Catalog (32)

1 2 4 8 13 26 52 101 104 202 404 449 808 898 1,313 1,796 2,626 3,592 5,252 5,837 10,504 11,674 23,348 45,349 46,696 90,698 181,396 362,792 589,537 1,179,074 2,358,148 4,716,296

Collatz Trajectory (131 steps to reach 1)

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

4,716,296 2,358,148 1,179,074 589,537 1,768,612 884,306 442,153 1,326,460 663,230 331,615 994,846 497,423 1,492,270 746,135 2,238,406 1,119,203 3,357,610 1,678,805 5,036,416 2,518,208 1,259,104 629,552 314,776 157,388 78,694 39,347 118,042 59,021 177,064 88,532 44,266 22,133 66,400 33,200 16,600 8,300 4,150 2,075 6,226 3,113 9,340 4,670 2,335 7,006 3,503 10,510 5,255 15,766 7,883 23,650 11,825 35,476 17,738 8,869 26,608 13,304 6,652 3,326 1,663 4,990

← Previous Integer #4,716,295 Browse Full Index Next Integer #4,716,297 →