9,135,462

2 × 3 × 7³ × 23 × 193

9,135,462 factors as 2 × 3 × 7^3 × 23 × 193. Its 64 positive divisors give a proper-divisor sum of 13,213,338, so this integer is abundant. The Collatz stopping time is 225 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7^3 × 23 × 193

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 22,348,800

Proper Divisor Sum 13,213,338

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #9135461 ← → #9135521

Radix Representation

Decimal	9135462
Binary	100010110110010101100110 (24 bits)
Octal	0o42662546
Hexadecimal	0x8B6566

Divisor Catalog (60 of 64)

1 2 3 6 7 14 21 23 42 46 49 69 98 138 147 161 193 294 322 343 386 483 579 686 966 1,029 1,127 1,158 1,351 2,058 2,254 2,702 3,381 4,053 4,439 6,762 7,889 8,106 8,878 9,457 13,317 15,778 18,914 23,667 26,634 28,371 31,073 47,334 56,742 62,146 66,199 93,219 132,398 186,438 198,597 217,511 397,194 435,022 652,533 1,305,066

Collatz Trajectory (225 steps to reach 1)

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

9,135,462 4,567,731 13,703,194 6,851,597 20,554,792 10,277,396 5,138,698 2,569,349 7,708,048 3,854,024 1,927,012 963,506 481,753 1,445,260 722,630 361,315 1,083,946 541,973 1,625,920 812,960 406,480 203,240 101,620 50,810 25,405 76,216 38,108 19,054 9,527 28,582 14,291 42,874 21,437 64,312 32,156 16,078 8,039 24,118 12,059 36,178 18,089 54,268 27,134 13,567 40,702 20,351 61,054 30,527 91,582 45,791 137,374 68,687 206,062 103,031 309,094 154,547 463,642 231,821 695,464 347,732

← Previous Integer #9,135,461 Browse Full Index Next Integer #9,135,463 →