Base | Representation |
---|---|
bin | 1010000110000111100011… |
… | …0010100101101000000101 |
3 | 1110022011121120001210212211 |
4 | 2201201320302211220011 |
5 | 2423331223314120401 |
6 | 35335212133143421 |
7 | 2223651564250624 |
oct | 241417062455005 |
9 | 43264546053784 |
10 | 11100222020101 |
11 | 359a639a47aa5 |
12 | 12b3369a8ab71 |
13 | 626991c2a826 |
14 | 2a5379cab6bb |
15 | 143b2014c951 |
hex | a1878ca5a05 |
11100222020101 has 2 divisors, whose sum is σ = 11100222020102. Its totient is φ = 11100222020100.
The previous prime is 11100222020053. The next prime is 11100222020117. The reversal of 11100222020101 is 10102022200111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9652113036225 + 1448108983876 = 3106785^2 + 1203374^2 .
It is an emirp because it is prime and its reverse (10102022200111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11100222020101 - 213 = 11100222011909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11100222020131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550111010050 + 5550111010051.
It is an arithmetic number, because the mean of its divisors is an integer number (5550111010051).
Almost surely, 211100222020101 is an apocalyptic number.
It is an amenable number.
11100222020101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11100222020101 is an equidigital number, since it uses as much as digits as its factorization.
11100222020101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 11100222020101 its reverse (10102022200111), we get a palindrome (21202244220212).
The spelling of 11100222020101 in words is "eleven trillion, one hundred billion, two hundred twenty-two million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •