9,454,458

2 × 3 × 13 × 53 × 2287

9,454,458 factors as 2 × 3 × 13 × 53 × 2287. Its 32 positive divisors give a proper-divisor sum of 11,302,278, so this integer is abundant. The Collatz stopping time is 132 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 53 × 2287

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 20,756,736

Proper Divisor Sum 11,302,278

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #9454439 ← → #9454463

Radix Representation

Decimal	9454458
Binary	100100000100001101111010 (24 bits)
Octal	0o44041572
Hexadecimal	0x90437A

Divisor Catalog (32)

1 2 3 6 13 26 39 53 78 106 159 318 689 1,378 2,067 2,287 4,134 4,574 6,861 13,722 29,731 59,462 89,193 121,211 178,386 242,422 363,633 727,266 1,575,743 3,151,486 4,727,229 9,454,458

Collatz Trajectory (132 steps to reach 1)

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

9,454,458 4,727,229 14,181,688 7,090,844 3,545,422 1,772,711 5,318,134 2,659,067 7,977,202 3,988,601 11,965,804 5,982,902 2,991,451 8,974,354 4,487,177 13,461,532 6,730,766 3,365,383 10,096,150 5,048,075 15,144,226 7,572,113 22,716,340 11,358,170 5,679,085 17,037,256 8,518,628 4,259,314 2,129,657 6,388,972 3,194,486 1,597,243 4,791,730 2,395,865 7,187,596 3,593,798 1,796,899 5,390,698 2,695,349 8,086,048 4,043,024 2,021,512 1,010,756 505,378 252,689 758,068 379,034 189,517 568,552 284,276 142,138 71,069 213,208 106,604 53,302 26,651 79,954 39,977 119,932 59,966

← Previous Integer #9,454,457 Browse Full Index Next Integer #9,454,459 →