Base | Representation |
---|---|
bin | 10010101000000110… |
… | …00011110110111011 |
3 | 221210220210210122011 |
4 | 21110003003312323 |
5 | 130440001213341 |
6 | 4332143110351 |
7 | 502544535631 |
oct | 112403036673 |
9 | 27726723564 |
10 | 10000022971 |
11 | 42718302a4 |
12 | 1b30ba23b7 |
13 | c349c7a73 |
14 | 6ac16b351 |
15 | 3d7db4b81 |
hex | 2540c3dbb |
10000022971 has 2 divisors, whose sum is σ = 10000022972. Its totient is φ = 10000022970.
The previous prime is 10000022947. The next prime is 10000023017. The reversal of 10000022971 is 17922000001.
10000022971 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 is an emirp because it is prime and its reverse (17922000001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10000022971 - 229 = 9463152059 is a prime.
It is not a weakly prime, because it can be changed into another prime (10000022941) 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, 5000011485 + 5000011486.
It is an arithmetic number, because the mean of its divisors is an integer number (5000011486).
Almost surely, 210000022971 is an apocalyptic number.
10000022971 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000022971 is an equidigital number, since it uses as much as digits as its factorization.
10000022971 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 22.
Adding to 10000022971 its reverse (17922000001), we get a palindrome (27922022972).
The spelling of 10000022971 in words is "ten billion, twenty-two thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •