9,230,259

3 × 3076753

9,230,259 factors as 3 × 3076753. Its 4 positive divisors give a proper-divisor sum of 3,076,757, so this integer is deficient. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 3 × 3076753

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 12,307,016

Proper Divisor Sum 3,076,757

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #9230239 ← → #9230267

Radix Representation

Decimal	9230259
Binary	100011001101011110110011 (24 bits)
Octal	0o43153663
Hexadecimal	0x8CD7B3

Divisor Catalog (4)

1 3 3,076,753 9,230,259

Collatz Trajectory (88 steps to reach 1)

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

9,230,259 27,690,778 13,845,389 41,536,168 20,768,084 10,384,042 5,192,021 15,576,064 7,788,032 3,894,016 1,947,008 973,504 486,752 243,376 121,688 60,844 30,422 15,211 45,634 22,817 68,452 34,226 17,113 51,340 25,670 12,835 38,506 19,253 57,760 28,880 14,440 7,220 3,610 1,805 5,416 2,708 1,354 677 2,032 1,016 508 254 127 382 191 574 287 862 431 1,294 647 1,942 971 2,914 1,457 4,372 2,186 1,093 3,280 1,640

← Previous Integer #9,230,258 Browse Full Index Next Integer #9,230,260 →