Base | Representation |
---|---|
bin | 10010000101111111… |
… | …01011000000110101 |
3 | 221001222110101000122 |
4 | 21002333223000311 |
5 | 124343231001401 |
6 | 4243523021325 |
7 | 462501655412 |
oct | 110277530065 |
9 | 27058411018 |
10 | 9713922101 |
11 | 413528a4a4 |
12 | 1a7120a845 |
13 | bba655500 |
14 | 682175109 |
15 | 3bcbee21b |
hex | 242feb035 |
9713922101 has 12 divisors (see below), whose sum is σ = 10557489600. Its totient is φ = 8933567760.
The previous prime is 9713922091. The next prime is 9713922103. The reversal of 9713922101 is 1012293179.
9713922101 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 9713922101 - 214 = 9713905717 is a prime.
It is a Duffinian number.
It is a nialpdrome in base 13.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (9713922103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 60251 + ... + 151848.
It is an arithmetic number, because the mean of its divisors is an integer number (879790800).
Almost surely, 29713922101 is an apocalyptic number.
It is an amenable number.
9713922101 is a deficient number, since it is larger than the sum of its proper divisors (843567499).
9713922101 is a wasteful number, since it uses less digits than its factorization.
9713922101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212396 (or 212383 counting only the distinct ones).
The product of its (nonzero) digits is 6804, while the sum is 35.
The square root of 9713922101 is about 98559.2314347063. The cubic root of 9713922101 is about 2133.6910661135.
The spelling of 9713922101 in words is "nine billion, seven hundred thirteen million, nine hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •