Base | Representation |
---|---|
bin | 1100010100010011111… |
… | …1110101011011111001 |
3 | 202020012112101200122212 |
4 | 3011010333311123321 |
5 | 11431334402412022 |
6 | 241113541424505 |
7 | 21200626445612 |
oct | 3050477653371 |
9 | 666175350585 |
10 | 211610982137 |
11 | 8181a978a05 |
12 | 3501810b135 |
13 | 16c549b8cc9 |
14 | a356196c09 |
15 | 57879a03e2 |
hex | 3144ff56f9 |
211610982137 has 2 divisors, whose sum is σ = 211610982138. Its totient is φ = 211610982136.
The previous prime is 211610982083. The next prime is 211610982157. The reversal of 211610982137 is 731289016112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 155485107856 + 56125874281 = 394316^2 + 236909^2 .
It is a cyclic number.
It is not a de Polignac number, because 211610982137 - 212 = 211610978041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 211610982094 and 211610982103.
It is not a weakly prime, because it can be changed into another prime (211610982157) 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, 105805491068 + 105805491069.
It is an arithmetic number, because the mean of its divisors is an integer number (105805491069).
Almost surely, 2211610982137 is an apocalyptic number.
It is an amenable number.
211610982137 is a deficient number, since it is larger than the sum of its proper divisors (1).
211610982137 is an equidigital number, since it uses as much as digits as its factorization.
211610982137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36288, while the sum is 41.
Adding to 211610982137 its reverse (731289016112), we get a palindrome (942899998249).
The spelling of 211610982137 in words is "two hundred eleven billion, six hundred ten million, nine hundred eighty-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •