9,061,264

2⁴ × 23 × 24623

9,061,264 factors as 2^4 × 23 × 24623. Its 20 positive divisors give a proper-divisor sum of 9,258,992, so this integer is abundant. The Collatz stopping time is 93 steps.

Prime Factor Structure

Factorization String 2^4 × 23 × 24623

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 18,320,256

Proper Divisor Sum 9,258,992

Digit Sum / Digital Root 28 (Root: 1)

Adjacent Primes #9061259 ← → #9061267

Radix Representation

Decimal	9061264
Binary	100010100100001110010000 (24 bits)
Octal	0o42441620
Hexadecimal	0x8A4390

Divisor Catalog (20)

1 2 4 8 16 23 46 92 184 368 24,623 49,246 98,492 196,984 393,968 566,329 1,132,658 2,265,316 4,530,632 9,061,264

Collatz Trajectory (93 steps to reach 1)

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

9,061,264 4,530,632 2,265,316 1,132,658 566,329 1,698,988 849,494 424,747 1,274,242 637,121 1,911,364 955,682 477,841 1,433,524 716,762 358,381 1,075,144 537,572 268,786 134,393 403,180 201,590 100,795 302,386 151,193 453,580 226,790 113,395 340,186 170,093 510,280 255,140 127,570 63,785 191,356 95,678 47,839 143,518 71,759 215,278 107,639 322,918 161,459 484,378 242,189 726,568 363,284 181,642 90,821 272,464 136,232 68,116 34,058 17,029 51,088 25,544 12,772 6,386 3,193 9,580

← Previous Integer #9,061,263 Browse Full Index Next Integer #9,061,265 →