9,513,260

2² × 5 × 23 × 20681

9,513,260 factors as 2^2 × 5 × 23 × 20681. Its 24 positive divisors give a proper-divisor sum of 11,334,196, so this integer is abundant. The Collatz stopping time is 145 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 23 × 20681

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 20,847,456

Proper Divisor Sum 11,334,196

Digit Sum / Digital Root 26 (Root: 8)

Adjacent Primes #9513253 ← → #9513269

Radix Representation

Decimal	9513260
Binary	100100010010100100101100 (24 bits)
Octal	0o44224454
Hexadecimal	0x91292C

Divisor Catalog (24)

1 2 4 5 10 20 23 46 92 115 230 460 20,681 41,362 82,724 103,405 206,810 413,620 475,663 951,326 1,902,652 2,378,315 4,756,630 9,513,260

Collatz Trajectory (145 steps to reach 1)

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

9,513,260 4,756,630 2,378,315 7,134,946 3,567,473 10,702,420 5,351,210 2,675,605 8,026,816 4,013,408 2,006,704 1,003,352 501,676 250,838 125,419 376,258 188,129 564,388 282,194 141,097 423,292 211,646 105,823 317,470 158,735 476,206 238,103 714,310 357,155 1,071,466 535,733 1,607,200 803,600 401,800 200,900 100,450 50,225 150,676 75,338 37,669 113,008 56,504 28,252 14,126 7,063 21,190 10,595 31,786 15,893 47,680 23,840 11,920 5,960 2,980 1,490 745 2,236 1,118 559 1,678

← Previous Integer #9,513,259 Browse Full Index Next Integer #9,513,261 →