Base | Representation |
---|---|
bin | 10010110101010101… |
… | …10100101100010101 |
3 | 222002122211121021012 |
4 | 21122222310230111 |
5 | 131201421004114 |
6 | 4351152102005 |
7 | 505364005355 |
oct | 113252645425 |
9 | 28078747235 |
10 | 10111109909 |
11 | 431950458a |
12 | 1b62234905 |
13 | c51a20a94 |
14 | 6bcc06b65 |
15 | 3e2a0963e |
hex | 25aab4b15 |
10111109909 has 2 divisors, whose sum is σ = 10111109910. Its totient is φ = 10111109908.
The previous prime is 10111109893. The next prime is 10111109923. The reversal of 10111109909 is 90990111101.
10111109909 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., 6971749009 + 3139360900 = 83497^2 + 56030^2 .
It is a cyclic number.
It is not a de Polignac number, because 10111109909 - 24 = 10111109893 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111109969) 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, 5055554954 + 5055554955.
It is an arithmetic number, because the mean of its divisors is an integer number (5055554955).
Almost surely, 210111109909 is an apocalyptic number.
It is an amenable number.
10111109909 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111109909 is an equidigital number, since it uses as much as digits as its factorization.
10111109909 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 729, while the sum is 32.
The spelling of 10111109909 in words is "ten billion, one hundred eleven million, one hundred nine thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •