Base | Representation |
---|---|
bin | 10010101001001011… |
… | …01001111110100001 |
3 | 221211112212120000011 |
4 | 21110211221332201 |
5 | 130444311421001 |
6 | 4333105324521 |
7 | 503014610146 |
oct | 112445517641 |
9 | 27745776004 |
10 | 10009092001 |
11 | 4276964a67 |
12 | 1b34036741 |
13 | c3685195c |
14 | 6ad44c3cd |
15 | 3d8aa6d51 |
hex | 254969fa1 |
10009092001 has 2 divisors, whose sum is σ = 10009092002. Its totient is φ = 10009092000.
The previous prime is 10009091969. The next prime is 10009092019. The reversal of 10009092001 is 10029090001.
10009092001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7299993600 + 2709098401 = 85440^2 + 52049^2 .
It is a cyclic number.
It is not a de Polignac number, because 10009092001 - 25 = 10009091969 is a prime.
It is not a weakly prime, because it can be changed into another prime (10009095001) 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, 5004546000 + 5004546001.
It is an arithmetic number, because the mean of its divisors is an integer number (5004546001).
Almost surely, 210009092001 is an apocalyptic number.
It is an amenable number.
10009092001 is a deficient number, since it is larger than the sum of its proper divisors (1).
10009092001 is an equidigital number, since it uses as much as digits as its factorization.
10009092001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 22.
The spelling of 10009092001 in words is "ten billion, nine million, ninety-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •