Base | Representation |
---|---|
bin | 11001010100111… |
… | …00011100010001 |
3 | 112210202201220201 |
4 | 30222130130101 |
5 | 413342000022 |
6 | 33025335201 |
7 | 5156551621 |
oct | 1452343421 |
9 | 483681821 |
10 | 212453137 |
11 | a9a19206 |
12 | 5b197501 |
13 | 35027620 |
14 | 20304881 |
15 | 139b9127 |
hex | ca9c711 |
212453137 has 8 divisors (see below), whose sum is σ = 236176640. Its totient is φ = 189784080.
The previous prime is 212453107. The next prime is 212453167. The reversal of 212453137 is 731354212.
It is an interprime number because it is at equal distance from previous prime (212453107) and next prime (212453167).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 212453137 - 27 = 212453009 is a prime.
It is a super-2 number, since 2×2124531372 = 90272670842281538, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212453107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 263187 + ... + 263992.
It is an arithmetic number, because the mean of its divisors is an integer number (29522080).
Almost surely, 2212453137 is an apocalyptic number.
It is an amenable number.
212453137 is a deficient number, since it is larger than the sum of its proper divisors (23723503).
212453137 is a wasteful number, since it uses less digits than its factorization.
212453137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 527223.
The product of its digits is 5040, while the sum is 28.
The square root of 212453137 is about 14575.7722608444. The cubic root of 212453137 is about 596.6977259129.
The spelling of 212453137 in words is "two hundred twelve million, four hundred fifty-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •