Base | Representation |
---|---|
bin | 1100010101110011111… |
… | …0010011110000100101 |
3 | 202021020120022021011211 |
4 | 3011130332103300211 |
5 | 11433200342011422 |
6 | 241221511231421 |
7 | 21213612523306 |
oct | 3053476236045 |
9 | 667216267154 |
10 | 212013235237 |
11 | 81a06a42691 |
12 | 3510a978571 |
13 | 16cba138cab |
14 | a3937867ad |
15 | 57ace5b577 |
hex | 315cf93c25 |
212013235237 has 2 divisors, whose sum is σ = 212013235238. Its totient is φ = 212013235236.
The previous prime is 212013235229. The next prime is 212013235241. The reversal of 212013235237 is 732532310212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 132553518241 + 79459716996 = 364079^2 + 281886^2 .
It is a cyclic number.
It is not a de Polignac number, because 212013235237 - 23 = 212013235229 is a prime.
It is a super-2 number, since 2×2120132352372 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 212013235199 and 212013235208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212013235207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106006617618 + 106006617619.
It is an arithmetic number, because the mean of its divisors is an integer number (106006617619).
Almost surely, 2212013235237 is an apocalyptic number.
It is an amenable number.
212013235237 is a deficient number, since it is larger than the sum of its proper divisors (1).
212013235237 is an equidigital number, since it uses as much as digits as its factorization.
212013235237 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15120, while the sum is 31.
Adding to 212013235237 its reverse (732532310212), we get a palindrome (944545545449).
The spelling of 212013235237 in words is "two hundred twelve billion, thirteen million, two hundred thirty-five thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •