Base | Representation |
---|---|
bin | 10010110110101100… |
… | …00000111001101101 |
3 | 222010110010211101221 |
4 | 21123112000321231 |
5 | 131212320311414 |
6 | 4352234503341 |
7 | 505562152606 |
oct | 113326007155 |
9 | 28113124357 |
10 | 10122432109 |
11 | 4324938079 |
12 | 1b65b94b51 |
13 | c541863ca |
14 | 6c0512dad |
15 | 3e39e4224 |
hex | 25b580e6d |
10122432109 has 2 divisors, whose sum is σ = 10122432110. Its totient is φ = 10122432108.
The previous prime is 10122432091. The next prime is 10122432119. The reversal of 10122432109 is 90123422101.
10122432109 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (10122432091) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10103265225 + 19166884 = 100515^2 + 4378^2 .
It is a cyclic number.
It is not a de Polignac number, because 10122432109 - 27 = 10122431981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10122432119) 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, 5061216054 + 5061216055.
It is an arithmetic number, because the mean of its divisors is an integer number (5061216055).
Almost surely, 210122432109 is an apocalyptic number.
It is an amenable number.
10122432109 is a deficient number, since it is larger than the sum of its proper divisors (1).
10122432109 is an equidigital number, since it uses as much as digits as its factorization.
10122432109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 25.
The spelling of 10122432109 in words is "ten billion, one hundred twenty-two million, four hundred thirty-two thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •