9,803,415

3 × 5 × 653561

9,803,415 factors as 3 × 5 × 653561. Its 8 positive divisors give a proper-divisor sum of 5,882,073, so this integer is deficient. The Collatz stopping time is 119 steps.

Prime Factor Structure

Factorization String 3 × 5 × 653561

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 15,685,488

Proper Divisor Sum 5,882,073

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #9803413 ← → #9803429

Radix Representation

Decimal	9803415
Binary	100101011001011010010111 (24 bits)
Octal	0o45313227
Hexadecimal	0x959697

Divisor Catalog (8)

1 3 5 15 653,561 1,960,683 3,267,805 9,803,415

Collatz Trajectory (119 steps to reach 1)

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

9,803,415 29,410,246 14,705,123 44,115,370 22,057,685 66,173,056 33,086,528 16,543,264 8,271,632 4,135,816 2,067,908 1,033,954 516,977 1,550,932 775,466 387,733 1,163,200 581,600 290,800 145,400 72,700 36,350 18,175 54,526 27,263 81,790 40,895 122,686 61,343 184,030 92,015 276,046 138,023 414,070 207,035 621,106 310,553 931,660 465,830 232,915 698,746 349,373 1,048,120 524,060 262,030 131,015 393,046 196,523 589,570 294,785 884,356 442,178 221,089 663,268 331,634 165,817 497,452 248,726 124,363 373,090

← Previous Integer #9,803,414 Browse Full Index Next Integer #9,803,416 →