Base | Representation |
---|---|
bin | 1010000000011010011001… |
… | …0010111000000011011101 |
3 | 1102221210121022121210021111 |
4 | 2200012212102320003131 |
5 | 2420230002002223401 |
6 | 35222201431102021 |
7 | 2213611542155362 |
oct | 240064622700335 |
9 | 42853538553244 |
10 | 11002201211101 |
11 | 3562009836441 |
12 | 1298372b11911 |
13 | 61a67048aa29 |
14 | 2a071ba4a469 |
15 | 1412d4a64e51 |
hex | a01a64b80dd |
11002201211101 has 2 divisors, whose sum is σ = 11002201211102. Its totient is φ = 11002201211100.
The previous prime is 11002201211081. The next prime is 11002201211117. The reversal of 11002201211101 is 10111210220011.
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., 10537587207225 + 464614003876 = 3246165^2 + 681626^2 .
It is a cyclic number.
It is not a de Polignac number, because 11002201211101 - 211 = 11002201209053 is a prime.
It is a super-2 number, since 2×110022012111012 (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 (11002201211501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5501100605550 + 5501100605551.
It is an arithmetic number, because the mean of its divisors is an integer number (5501100605551).
Almost surely, 211002201211101 is an apocalyptic number.
It is an amenable number.
11002201211101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11002201211101 is an equidigital number, since it uses as much as digits as its factorization.
11002201211101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11002201211101 its reverse (10111210220011), we get a palindrome (21113411431112).
The spelling of 11002201211101 in words is "eleven trillion, two billion, two hundred one million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •