Base | Representation |
---|---|
bin | 1010001100100100111110… |
… | …1010101001110110100101 |
3 | 1110200210001220000111121201 |
4 | 2203021033222221312211 |
5 | 2432141020003132401 |
6 | 35502204342442501 |
7 | 2234661006026344 |
oct | 243111752516645 |
9 | 43623056014551 |
10 | 11211201224101 |
11 | 36327098a760a |
12 | 1310980733431 |
13 | 63429a263088 |
14 | 2aa8a7147b5b |
15 | 1469681b9b01 |
hex | a324faa9da5 |
11211201224101 has 2 divisors, whose sum is σ = 11211201224102. Its totient is φ = 11211201224100.
The previous prime is 11211201224089. The next prime is 11211201224131. The reversal of 11211201224101 is 10142210211211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6657561050625 + 4553640173476 = 2580225^2 + 2133926^2 .
It is a cyclic number.
It is not a de Polignac number, because 11211201224101 - 213 = 11211201215909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11211201224131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5605600612050 + 5605600612051.
It is an arithmetic number, because the mean of its divisors is an integer number (5605600612051).
Almost surely, 211211201224101 is an apocalyptic number.
It is an amenable number.
11211201224101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11211201224101 is an equidigital number, since it uses as much as digits as its factorization.
11211201224101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 11211201224101 its reverse (10142210211211), we get a palindrome (21353411435312).
The spelling of 11211201224101 in words is "eleven trillion, two hundred eleven billion, two hundred one million, two hundred twenty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •