Base | Representation |
---|---|
bin | 1010000110001010011101… |
… | …0010011100001101110101 |
3 | 1110022020121220222002122111 |
4 | 2201202213102130031311 |
5 | 2423334323020401401 |
6 | 35335421401331021 |
7 | 2224010116101523 |
oct | 241424722341565 |
9 | 43266556862574 |
10 | 11101002122101 |
11 | 359a9aa3281a1 |
12 | 12b3547196a71 |
13 | 626a87734848 |
14 | 2a5411737313 |
15 | 143b68893e51 |
hex | a18a749c375 |
11101002122101 has 2 divisors, whose sum is σ = 11101002122102. Its totient is φ = 11101002122100.
The previous prime is 11101002122027. The next prime is 11101002122141. The reversal of 11101002122101 is 10122120010111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8181739419876 + 2919262702225 = 2860374^2 + 1708585^2 .
It is a cyclic number.
It is not a de Polignac number, because 11101002122101 - 221 = 11101000024949 is a prime.
It is a super-2 number, since 2×111010021221012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11101002122141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550501061050 + 5550501061051.
It is an arithmetic number, because the mean of its divisors is an integer number (5550501061051).
Almost surely, 211101002122101 is an apocalyptic number.
It is an amenable number.
11101002122101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101002122101 is an equidigital number, since it uses as much as digits as its factorization.
11101002122101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11101002122101 its reverse (10122120010111), we get a palindrome (21223122132212).
The spelling of 11101002122101 in words is "eleven trillion, one hundred one billion, two million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •