Base | Representation |
---|---|
bin | 1010001100100001010000… |
… | …0011100001111000100101 |
3 | 1110200200111012010112212112 |
4 | 2203020110003201320211 |
5 | 2432131442441041401 |
6 | 35501521214530405 |
7 | 2234624143151045 |
oct | 243102403417045 |
9 | 43620435115775 |
10 | 11210201112101 |
11 | 3632246307672 |
12 | 1310741806a05 |
13 | 63416acb6c24 |
14 | 2aa8103ab725 |
15 | 14690a4b53bb |
hex | a32140e1e25 |
11210201112101 has 2 divisors, whose sum is σ = 11210201112102. Its totient is φ = 11210201112100.
The previous prime is 11210201112091. The next prime is 11210201112133. The reversal of 11210201112101 is 10121110201211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6274028049601 + 4936173062500 = 2504801^2 + 2221750^2 .
It is a cyclic number.
It is not a de Polignac number, because 11210201112101 - 218 = 11210200849957 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11210201112191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5605100556050 + 5605100556051.
It is an arithmetic number, because the mean of its divisors is an integer number (5605100556051).
Almost surely, 211210201112101 is an apocalyptic number.
It is an amenable number.
11210201112101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11210201112101 is an equidigital number, since it uses as much as digits as its factorization.
11210201112101 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 14.
Adding to 11210201112101 its reverse (10121110201211), we get a palindrome (21331311313312).
The spelling of 11210201112101 in words is "eleven trillion, two hundred ten billion, two hundred one million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •