9,299,733

3 × 3099911

9,299,733 factors as 3 × 3099911. Its 4 positive divisors give a proper-divisor sum of 3,099,915, so this integer is deficient. The Collatz stopping time is 106 steps.

Prime Factor Structure

Factorization String 3 × 3099911

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 12,399,648

Proper Divisor Sum 3,099,915

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #9299723 ← → #9299747

Radix Representation

Decimal	9299733
Binary	100011011110011100010101 (24 bits)
Octal	0o43363425
Hexadecimal	0x8DE715

Divisor Catalog (4)

1 3 3,099,911 9,299,733

Collatz Trajectory (106 steps to reach 1)

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

9,299,733 27,899,200 13,949,600 6,974,800 3,487,400 1,743,700 871,850 435,925 1,307,776 653,888 326,944 163,472 81,736 40,868 20,434 10,217 30,652 15,326 7,663 22,990 11,495 34,486 17,243 51,730 25,865 77,596 38,798 19,399 58,198 29,099 87,298 43,649 130,948 65,474 32,737 98,212 49,106 24,553 73,660 36,830 18,415 55,246 27,623 82,870 41,435 124,306 62,153 186,460 93,230 46,615 139,846 69,923 209,770 104,885 314,656 157,328 78,664 39,332 19,666 9,833

← Previous Integer #9,299,732 Browse Full Index Next Integer #9,299,734 →