Base | Representation |
---|---|
bin | 1010000111011001001000… |
… | …1011000101110010111001 |
3 | 1110101021010212002010210012 |
4 | 2201312102023011302321 |
5 | 2424211101403211301 |
6 | 35353233241031305 |
7 | 2225355366120236 |
oct | 241662213056271 |
9 | 43337125063705 |
10 | 11122122710201 |
11 | 35a8958353688 |
12 | 12b7660485535 |
13 | 628a7231b159 |
14 | 2a645679a78d |
15 | 1444a2bb0ebb |
hex | a1d922c5cb9 |
11122122710201 has 2 divisors, whose sum is σ = 11122122710202. Its totient is φ = 11122122710200.
The previous prime is 11122122710159. The next prime is 11122122710221. The reversal of 11122122710201 is 10201722122111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6958384515625 + 4163738194576 = 2637875^2 + 2040524^2 .
It is a cyclic number.
It is not a de Polignac number, because 11122122710201 - 242 = 6724076199097 is a prime.
It is a super-2 number, since 2×111221227102012 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11122122710221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5561061355100 + 5561061355101.
It is an arithmetic number, because the mean of its divisors is an integer number (5561061355101).
Almost surely, 211122122710201 is an apocalyptic number.
It is an amenable number.
11122122710201 is a deficient number, since it is larger than the sum of its proper divisors (1).
11122122710201 is an equidigital number, since it uses as much as digits as its factorization.
11122122710201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 23.
Adding to 11122122710201 its reverse (10201722122111), we get a palindrome (21323844832312).
The spelling of 11122122710201 in words is "eleven trillion, one hundred twenty-two billion, one hundred twenty-two million, seven hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •