Base | Representation |
---|---|
bin | 10100011111010011… |
… | …01101010110011001 |
3 | 1001101121110102010212 |
4 | 22033221231112121 |
5 | 140012000311022 |
6 | 5015304220505 |
7 | 536406354254 |
oct | 121751552631 |
9 | 31347412125 |
10 | 11000010137 |
11 | 4735245476 |
12 | 216ba6a735 |
13 | 1063c2c14c |
14 | 764cb409b |
15 | 445a923e2 |
hex | 28fa6d599 |
11000010137 has 2 divisors, whose sum is σ = 11000010138. Its totient is φ = 11000010136.
The previous prime is 11000010113. The next prime is 11000010211. The reversal of 11000010137 is 73101000011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10970677081 + 29333056 = 104741^2 + 5416^2 .
It is a cyclic number.
It is not a de Polignac number, because 11000010137 - 212 = 11000006041 is a prime.
It is not a weakly prime, because it can be changed into another prime (11000010737) 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, 5500005068 + 5500005069.
It is an arithmetic number, because the mean of its divisors is an integer number (5500005069).
Almost surely, 211000010137 is an apocalyptic number.
It is an amenable number.
11000010137 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000010137 is an equidigital number, since it uses as much as digits as its factorization.
11000010137 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 11000010137 its reverse (73101000011), we get a palindrome (84101010148).
The spelling of 11000010137 in words is "eleven billion, ten thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •