Base | Representation |
---|---|
bin | 1100010010011010101… |
… | …0101110011110011001 |
3 | 202011220001220102122222 |
4 | 3010212222232132121 |
5 | 11424314121211441 |
6 | 240551243153425 |
7 | 21152210342066 |
oct | 3044652563631 |
9 | 664801812588 |
10 | 211102132121 |
11 | 81589717401 |
12 | 34ab5815875 |
13 | 16ba345591a |
14 | a308779c6d |
15 | 5757e89d4b |
hex | 3126aae799 |
211102132121 has 2 divisors, whose sum is σ = 211102132122. Its totient is φ = 211102132120.
The previous prime is 211102132099. The next prime is 211102132193. The reversal of 211102132121 is 121231201112.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 134550309721 + 76551822400 = 366811^2 + 276680^2 .
It is a cyclic number.
It is not a de Polignac number, because 211102132121 - 214 = 211102115737 is a prime.
It is a super-2 number, since 2×2111021321212 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 211102132121.
It is not a weakly prime, because it can be changed into another prime (211102132421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105551066060 + 105551066061.
It is an arithmetic number, because the mean of its divisors is an integer number (105551066061).
Almost surely, 2211102132121 is an apocalyptic number.
It is an amenable number.
211102132121 is a deficient number, since it is larger than the sum of its proper divisors (1).
211102132121 is an equidigital number, since it uses as much as digits as its factorization.
211102132121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 211102132121 its reverse (121231201112), we get a palindrome (332333333233).
The spelling of 211102132121 in words is "two hundred eleven billion, one hundred two million, one hundred thirty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •