Base | Representation |
---|---|
bin | 10010000110101101… |
… | …10110111000001101 |
3 | 221002101220011100111 |
4 | 21003112312320031 |
5 | 124401310000023 |
6 | 4244301200021 |
7 | 462604431313 |
oct | 110326667015 |
9 | 27071804314 |
10 | 9720000013 |
11 | 4138760969 |
12 | 1a73260011 |
13 | bbb9a2ac9 |
14 | 682cb80b3 |
15 | 3bd50000d |
hex | 2435b6e0d |
9720000013 has 2 divisors, whose sum is σ = 9720000014. Its totient is φ = 9720000012.
The previous prime is 9720000007. The next prime is 9720000041. The reversal of 9720000013 is 3100000279.
9720000013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9545680804 + 174319209 = 97702^2 + 13203^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-9720000013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (9720000613) 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 as a sum of consecutive naturals, namely, 4860000006 + 4860000007.
It is an arithmetic number, because the mean of its divisors is an integer number (4860000007).
Almost surely, 29720000013 is an apocalyptic number.
It is an amenable number.
9720000013 is a deficient number, since it is larger than the sum of its proper divisors (1).
9720000013 is an equidigital number, since it uses as much as digits as its factorization.
9720000013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 378, while the sum is 22.
The square root of 9720000013 is about 98590.0604168595. The cubic root of 9720000013 is about 2134.1359836455.
The spelling of 9720000013 in words is "nine billion, seven hundred twenty million, thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •