9,739,310

2 × 5 × 7 × 139133

9,739,310 factors as 2 × 5 × 7 × 139133. Its 16 positive divisors give a proper-divisor sum of 10,295,986, so this integer is abundant. The Collatz stopping time is 114 steps.

Prime Factor Structure

Factorization String 2 × 5 × 7 × 139133

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 20,035,296

Proper Divisor Sum 10,295,986

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #9739309 ← → #9739339

Radix Representation

Decimal	9739310
Binary	100101001001110000101110 (24 bits)
Octal	0o45116056
Hexadecimal	0x949C2E

Divisor Catalog (16)

1 2 5 7 10 14 35 70 139,133 278,266 695,665 973,931 1,391,330 1,947,862 4,869,655 9,739,310

Collatz Trajectory (114 steps to reach 1)

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

9,739,310 4,869,655 14,608,966 7,304,483 21,913,450 10,956,725 32,870,176 16,435,088 8,217,544 4,108,772 2,054,386 1,027,193 3,081,580 1,540,790 770,395 2,311,186 1,155,593 3,466,780 1,733,390 866,695 2,600,086 1,300,043 3,900,130 1,950,065 5,850,196 2,925,098 1,462,549 4,387,648 2,193,824 1,096,912 548,456 274,228 137,114 68,557 205,672 102,836 51,418 25,709 77,128 38,564 19,282 9,641 28,924 14,462 7,231 21,694 10,847 32,542 16,271 48,814 24,407 73,222 36,611 109,834 54,917 164,752 82,376 41,188 20,594 10,297

← Previous Integer #9,739,309 Browse Full Index Next Integer #9,739,311 →