9,319,140

2² × 3² × 5 × 23 × 2251

9,319,140 factors as 2^2 × 3^2 × 5 × 23 × 2251. Its 72 positive divisors give a proper-divisor sum of 20,191,068, so this integer is abundant. The Collatz stopping time is 75 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 5 × 23 × 2251

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 72

Divisor Sum (σ) 29,510,208

Proper Divisor Sum 20,191,068

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #9319103 ← → #9319181

Radix Representation

Decimal	9319140
Binary	100011100011001011100100 (24 bits)
Octal	0o43431344
Hexadecimal	0x8E32E4

Divisor Catalog (60 of 72)

1 2 3 4 5 6 9 10 12 15 18 20 23 30 36 45 46 60 69 90 92 115 138 180 207 230 276 345 414 460 690 828 1,035 1,380 2,070 2,251 4,140 4,502 6,753 9,004 11,255 13,506 20,259 22,510 27,012 33,765 40,518 45,020 51,773 67,530 81,036 101,295 103,546 135,060 155,319 202,590 207,092 258,865 310,638 405,180

Collatz Trajectory (75 steps to reach 1)

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

9,319,140 4,659,570 2,329,785 6,989,356 3,494,678 1,747,339 5,242,018 2,621,009 7,863,028 3,931,514 1,965,757 5,897,272 2,948,636 1,474,318 737,159 2,211,478 1,105,739 3,317,218 1,658,609 4,975,828 2,487,914 1,243,957 3,731,872 1,865,936 932,968 466,484 233,242 116,621 349,864 174,932 87,466 43,733 131,200 65,600 32,800 16,400 8,200 4,100 2,050 1,025 3,076 1,538 769 2,308 1,154 577 1,732 866 433 1,300 650 325 976 488 244 122 61 184 92 46

← Previous Integer #9,319,139 Browse Full Index Next Integer #9,319,141 →