Base | Representation |
---|---|
bin | 10100011111010100… |
… | …00011100010101101 |
3 | 1001101121122000211112 |
4 | 22033222003202231 |
5 | 140012011213122 |
6 | 5015310201405 |
7 | 536410213262 |
oct | 121752034255 |
9 | 31347560745 |
10 | 11000101037 |
11 | 47352a77a2 |
12 | 216bab3265 |
13 | 1063c61633 |
14 | 764cd9269 |
15 | 445aae2e2 |
hex | 28fa838ad |
11000101037 has 2 divisors, whose sum is σ = 11000101038. Its totient is φ = 11000101036.
The previous prime is 11000101033. The next prime is 11000101087. The reversal of 11000101037 is 73010100011.
11000101037 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 can be written as a sum of positive squares in only one way, i.e., 9473323561 + 1526777476 = 97331^2 + 39074^2 .
It is an emirp because it is prime and its reverse (73010100011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11000101037 - 22 = 11000101033 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11000101033) 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, 5500050518 + 5500050519.
It is an arithmetic number, because the mean of its divisors is an integer number (5500050519).
Almost surely, 211000101037 is an apocalyptic number.
It is an amenable number.
11000101037 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000101037 is an equidigital number, since it uses as much as digits as its factorization.
11000101037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21, while the sum is 14.
Adding to 11000101037 its reverse (73010100011), we get a palindrome (84010201048).
The spelling of 11000101037 in words is "eleven billion, one hundred one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •