Base | Representation |
---|---|
bin | 1100010111011100000… |
… | …1010000001000100101 |
3 | 202022101000120002221122 |
4 | 3011313001100020211 |
5 | 11440044223330222 |
6 | 241333121223325 |
7 | 21230500012166 |
oct | 3056701201045 |
9 | 668330502848 |
10 | 212450214437 |
11 | 8211067561a |
12 | 35211191b45 |
13 | 17059827176 |
14 | a3d581576d |
15 | 57d64c6a42 |
hex | 3177050225 |
212450214437 has 2 divisors, whose sum is σ = 212450214438. Its totient is φ = 212450214436.
The previous prime is 212450214377. The next prime is 212450214479. The reversal of 212450214437 is 734412054212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 199624878436 + 12825336001 = 446794^2 + 113249^2 .
It is a cyclic number.
It is not a de Polignac number, because 212450214437 - 26 = 212450214373 is a prime.
It is a super-2 number, since 2×2124502144372 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 212450214397 and 212450214406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212450214637) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106225107218 + 106225107219.
It is an arithmetic number, because the mean of its divisors is an integer number (106225107219).
Almost surely, 2212450214437 is an apocalyptic number.
It is an amenable number.
212450214437 is a deficient number, since it is larger than the sum of its proper divisors (1).
212450214437 is an equidigital number, since it uses as much as digits as its factorization.
212450214437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 53760, while the sum is 35.
Adding to 212450214437 its reverse (734412054212), we get a palindrome (946862268649).
The spelling of 212450214437 in words is "two hundred twelve billion, four hundred fifty million, two hundred fourteen thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.225 sec. • engine limits •