Base | Representation |
---|---|
bin | 1010000000010110010101… |
… | …0000100111110100110101 |
3 | 1102221200210021111200000102 |
4 | 2200011211100213310311 |
5 | 2420220233141220201 |
6 | 35221501252523445 |
7 | 2213542522660265 |
oct | 240054520476465 |
9 | 42850707450012 |
10 | 11001110101301 |
11 | 35615a9943501 |
12 | 1298109620585 |
13 | 61a528400728 |
14 | 2a0656b837a5 |
15 | 14126dd8826b |
hex | a0165427d35 |
11001110101301 has 2 divisors, whose sum is σ = 11001110101302. Its totient is φ = 11001110101300.
The previous prime is 11001110101279. The next prime is 11001110101309. The reversal of 11001110101301 is 10310101110011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6568405152100 + 4432704949201 = 2562890^2 + 2105399^2 .
It is a cyclic number.
It is not a de Polignac number, because 11001110101301 - 26 = 11001110101237 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11001110101309) 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, 5500555050650 + 5500555050651.
It is an arithmetic number, because the mean of its divisors is an integer number (5500555050651).
Almost surely, 211001110101301 is an apocalyptic number.
It is an amenable number.
11001110101301 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001110101301 is an equidigital number, since it uses as much as digits as its factorization.
11001110101301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 11.
Adding to 11001110101301 its reverse (10310101110011), we get a palindrome (21311211211312).
The spelling of 11001110101301 in words is "eleven trillion, one billion, one hundred ten million, one hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •