Base | Representation |
---|---|
bin | 1001001100011111011011… |
… | …1100100101000010011011 |
3 | 1022210112012022002100001101 |
4 | 2103013312330211002123 |
5 | 2311121142441413341 |
6 | 33300321241332231 |
7 | 2062303131420145 |
oct | 223076674450233 |
9 | 38715168070041 |
10 | 10110201122971 |
11 | 3248791a63864 |
12 | 1173511a97077 |
13 | 5845072138b1 |
14 | 26d49cd07c95 |
15 | 127ec9a17831 |
hex | 931f6f2509b |
10110201122971 has 2 divisors, whose sum is σ = 10110201122972. Its totient is φ = 10110201122970.
The previous prime is 10110201122969. The next prime is 10110201123049. The reversal of 10110201122971 is 17922110201101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10110201122971 - 21 = 10110201122969 is a prime.
Together with 10110201122969, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10110205122971) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055100561485 + 5055100561486.
It is an arithmetic number, because the mean of its divisors is an integer number (5055100561486).
Almost surely, 210110201122971 is an apocalyptic number.
10110201122971 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110201122971 is an equidigital number, since it uses as much as digits as its factorization.
10110201122971 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 28.
The spelling of 10110201122971 in words is "ten trillion, one hundred ten billion, two hundred one million, one hundred twenty-two thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •