9,701,053

563 × 17231

9,701,053 factors as 563 × 17231. Its 4 positive divisors give a proper-divisor sum of 17,795, so this integer is deficient. The Collatz stopping time is 101 steps.

Prime Factor Structure

Factorization String 563 × 17231

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 9,718,848

Proper Divisor Sum 17,795

Digit Sum / Digital Root 25 (Root: 7)

Adjacent Primes #9701017 ← → #9701063

Radix Representation

Decimal	9701053
Binary	100101000000011010111101 (24 bits)
Octal	0o45003275
Hexadecimal	0x9406BD

Divisor Catalog (4)

1 563 17,231 9,701,053

Collatz Trajectory (101 steps to reach 1)

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

9,701,053 29,103,160 14,551,580 7,275,790 3,637,895 10,913,686 5,456,843 16,370,530 8,185,265 24,555,796 12,277,898 6,138,949 18,416,848 9,208,424 4,604,212 2,302,106 1,151,053 3,453,160 1,726,580 863,290 431,645 1,294,936 647,468 323,734 161,867 485,602 242,801 728,404 364,202 182,101 546,304 273,152 136,576 68,288 34,144 17,072 8,536 4,268 2,134 1,067 3,202 1,601 4,804 2,402 1,201 3,604 1,802 901 2,704 1,352 676 338 169 508 254 127 382 191 574 287

← Previous Integer #9,701,052 Browse Full Index Next Integer #9,701,054 →