Base | Representation |
---|---|
bin | 1100011001111011110… |
… | …0101101011001101101 |
3 | 202101002201002102222021 |
4 | 3012132330231121231 |
5 | 11442432222042422 |
6 | 241523411350141 |
7 | 21253213031044 |
oct | 3063674553155 |
9 | 671081072867 |
10 | 213120112237 |
11 | 8242482476a |
12 | 353795b2351 |
13 | 17135556bb6 |
14 | a45a79555b |
15 | 58251eedc7 |
hex | 319ef2d66d |
213120112237 has 2 divisors, whose sum is σ = 213120112238. Its totient is φ = 213120112236.
The previous prime is 213120112207. The next prime is 213120112243. The reversal of 213120112237 is 732211021312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 212614132201 + 505980036 = 461101^2 + 22494^2 .
It is a cyclic number.
It is not a de Polignac number, because 213120112237 - 27 = 213120112109 is a prime.
It is a super-2 number, since 2×2131201122372 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213120112207) 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, 106560056118 + 106560056119.
It is an arithmetic number, because the mean of its divisors is an integer number (106560056119).
Almost surely, 2213120112237 is an apocalyptic number.
It is an amenable number.
213120112237 is a deficient number, since it is larger than the sum of its proper divisors (1).
213120112237 is an equidigital number, since it uses as much as digits as its factorization.
213120112237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 25.
Adding to 213120112237 its reverse (732211021312), we get a palindrome (945331133549).
The spelling of 213120112237 in words is "two hundred thirteen billion, one hundred twenty million, one hundred twelve thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •