9,015,397

211 × 42727

9,015,397 factors as 211 × 42727. Its 4 positive divisors give a proper-divisor sum of 42,939, so this integer is deficient. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 211 × 42727

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 9,058,336

Proper Divisor Sum 42,939

Digit Sum / Digital Root 34 (Root: 7)

Adjacent Primes #9015371 ← → #9015421

Radix Representation

Decimal	9015397
Binary	100010011001000001100101 (24 bits)
Octal	0o42310145
Hexadecimal	0x899065

Divisor Catalog (4)

1 211 42,727 9,015,397

Collatz Trajectory (88 steps to reach 1)

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

9,015,397 27,046,192 13,523,096 6,761,548 3,380,774 1,690,387 5,071,162 2,535,581 7,606,744 3,803,372 1,901,686 950,843 2,852,530 1,426,265 4,278,796 2,139,398 1,069,699 3,209,098 1,604,549 4,813,648 2,406,824 1,203,412 601,706 300,853 902,560 451,280 225,640 112,820 56,410 28,205 84,616 42,308 21,154 10,577 31,732 15,866 7,933 23,800 11,900 5,950 2,975 8,926 4,463 13,390 6,695 20,086 10,043 30,130 15,065 45,196 22,598 11,299 33,898 16,949 50,848 25,424 12,712 6,356 3,178 1,589

← Previous Integer #9,015,396 Browse Full Index Next Integer #9,015,398 →