Base | Representation |
---|---|
bin | 10100011110000111… |
… | …11100010100111011 |
3 | 1001100220211102201112 |
4 | 22033003330110323 |
5 | 140001432010021 |
6 | 5014312110535 |
7 | 536226252026 |
oct | 121703742473 |
9 | 31326742645 |
10 | 10990110011 |
11 | 472a6a3351 |
12 | 216869544b |
13 | 1061b73b9a |
14 | 7638581bd |
15 | 444c88d5b |
hex | 28f0fc53b |
10990110011 has 2 divisors, whose sum is σ = 10990110012. Its totient is φ = 10990110010.
The previous prime is 10990109993. The next prime is 10990110023. The reversal of 10990110011 is 11001109901.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10990110011 is a prime.
It is not a weakly prime, because it can be changed into another prime (10990119011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5495055005 + 5495055006.
It is an arithmetic number, because the mean of its divisors is an integer number (5495055006).
Almost surely, 210990110011 is an apocalyptic number.
10990110011 is a deficient number, since it is larger than the sum of its proper divisors (1).
10990110011 is an equidigital number, since it uses as much as digits as its factorization.
10990110011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 23.
Adding to 10990110011 its reverse (11001109901), we get a palindrome (21991219912).
The spelling of 10990110011 in words is "ten billion, nine hundred ninety million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •