Base | Representation |
---|---|
bin | 1100010010011110111… |
… | …0111011011101110001 |
3 | 202011221022112210001011 |
4 | 3010213232323131301 |
5 | 11424333210323441 |
6 | 240553122310521 |
7 | 21152515325335 |
oct | 3044756733561 |
9 | 664838483034 |
10 | 211120011121 |
11 | 81598819138 |
12 | 34abb7b8441 |
13 | 16ba7075806 |
14 | a30acb17c5 |
15 | 575981c581 |
hex | 3127bbb771 |
211120011121 has 2 divisors, whose sum is σ = 211120011122. Its totient is φ = 211120011120.
The previous prime is 211120011101. The next prime is 211120011133. The reversal of 211120011121 is 121110021112.
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., 179300586721 + 31819424400 = 423439^2 + 178380^2 .
It is a cyclic number.
It is not a de Polignac number, because 211120011121 - 237 = 73681057649 is a prime.
It is not a weakly prime, because it can be changed into another prime (211120011101) 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, 105560005560 + 105560005561.
It is an arithmetic number, because the mean of its divisors is an integer number (105560005561).
Almost surely, 2211120011121 is an apocalyptic number.
It is an amenable number.
211120011121 is a deficient number, since it is larger than the sum of its proper divisors (1).
211120011121 is an equidigital number, since it uses as much as digits as its factorization.
211120011121 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 13.
Adding to 211120011121 its reverse (121110021112), we get a palindrome (332230032233).
Subtracting from 211120011121 its reverse (121110021112), we obtain a palindrome (90009990009).
The spelling of 211120011121 in words is "two hundred eleven billion, one hundred twenty million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •