Base | Representation |
---|---|
bin | 1010000000110111011101… |
… | …0001010010110110110101 |
3 | 1102222112201222120012001201 |
4 | 2200031313101102312311 |
5 | 2420341441030431122 |
6 | 35225531501252501 |
7 | 2214306055406236 |
oct | 240156721226665 |
9 | 42875658505051 |
10 | 11010002202037 |
11 | 3565352238393 |
12 | 129998b564131 |
13 | 61b3147028b7 |
14 | 2a0c5bb0d08d |
15 | 1415de84ea27 |
hex | a0377452db5 |
11010002202037 has 2 divisors, whose sum is σ = 11010002202038. Its totient is φ = 11010002202036.
The previous prime is 11010002202013. The next prime is 11010002202097. The reversal of 11010002202037 is 73020220001011.
11010002202037 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., 7340149351441 + 3669852850596 = 2709271^2 + 1915686^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010002202037 - 219 = 11010001677749 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11010002202097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505001101018 + 5505001101019.
It is an arithmetic number, because the mean of its divisors is an integer number (5505001101019).
Almost surely, 211010002202037 is an apocalyptic number.
It is an amenable number.
11010002202037 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010002202037 is an equidigital number, since it uses as much as digits as its factorization.
11010002202037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 168, while the sum is 19.
Adding to 11010002202037 its reverse (73020220001011), we get a palindrome (84030222203048).
The spelling of 11010002202037 in words is "eleven trillion, ten billion, two million, two hundred two thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •