9,719,216

2⁴ × 13 × 46727

9,719,216 factors as 2^4 × 13 × 46727. Its 20 positive divisors give a proper-divisor sum of 10,560,736, so this integer is abundant. The Collatz stopping time is 101 steps.

Prime Factor Structure

Factorization String 2^4 × 13 × 46727

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 20,279,952

Proper Divisor Sum 10,560,736

Digit Sum / Digital Root 35 (Root: 8)

Adjacent Primes #9719209 ← → #9719219

Radix Representation

Decimal	9719216
Binary	100101000100110110110000 (24 bits)
Octal	0o45046660
Hexadecimal	0x944DB0

Divisor Catalog (20)

Collatz Trajectory (101 steps to reach 1)

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

9,719,216 4,859,608 2,429,804 1,214,902 607,451 1,822,354 911,177 2,733,532 1,366,766 683,383 2,050,150 1,025,075 3,075,226 1,537,613 4,612,840 2,306,420 1,153,210 576,605 1,729,816 864,908 432,454 216,227 648,682 324,341 973,024 486,512 243,256 121,628 60,814 30,407 91,222 45,611 136,834 68,417 205,252 102,626 51,313 153,940 76,970 38,485 115,456 57,728 28,864 14,432 7,216 3,608 1,804 902 451 1,354 677 2,032 1,016 508 254 127 382 191 574 287

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,719,215 Browse Full Index Next Integer #9,719,217 →