9,775,092

2² × 3 × 23 × 107 × 331

9,775,092 factors as 2^2 × 3 × 23 × 107 × 331. Its 48 positive divisors give a proper-divisor sum of 14,320,140, so this integer is abundant. The Collatz stopping time is 114 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 23 × 107 × 331

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 24,095,232

Proper Divisor Sum 14,320,140

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #9775091 ← → #9775093

Radix Representation

Decimal	9775092
Binary	100101010010011111110100 (24 bits)
Octal	0o45223764
Hexadecimal	0x9527F4

Divisor Catalog (48)

1 2 3 4 6 12 23 46 69 92 107 138 214 276 321 331 428 642 662 993 1,284 1,324 1,986 2,461 3,972 4,922 7,383 7,613 9,844 14,766 15,226 22,839 29,532 30,452 35,417 45,678 70,834 91,356 106,251 141,668 212,502 425,004 814,591 1,629,182 2,443,773 3,258,364 4,887,546 9,775,092

Collatz Trajectory (114 steps to reach 1)

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

9,775,092 4,887,546 2,443,773 7,331,320 3,665,660 1,832,830 916,415 2,749,246 1,374,623 4,123,870 2,061,935 6,185,806 3,092,903 9,278,710 4,639,355 13,918,066 6,959,033 20,877,100 10,438,550 5,219,275 15,657,826 7,828,913 23,486,740 11,743,370 5,871,685 17,615,056 8,807,528 4,403,764 2,201,882 1,100,941 3,302,824 1,651,412 825,706 412,853 1,238,560 619,280 309,640 154,820 77,410 38,705 116,116 58,058 29,029 87,088 43,544 21,772 10,886 5,443 16,330 8,165 24,496 12,248 6,124 3,062 1,531 4,594 2,297 6,892 3,446 1,723

← Previous Integer #9,775,091 Browse Full Index Next Integer #9,775,093 →