Base | Representation |
---|---|
bin | 11001010010011… |
… | …10000010101101 |
3 | 112210011102102020 |
4 | 30221032002231 |
5 | 413301211023 |
6 | 33014420353 |
7 | 5154043452 |
oct | 1451160255 |
9 | 483142366 |
10 | 212132013 |
11 | a9819a15 |
12 | 5b0616b9 |
13 | 34c44402 |
14 | 2025d829 |
15 | 13953de3 |
hex | ca4e0ad |
212132013 has 16 divisors (see below), whose sum is σ = 305320320. Its totient is φ = 130606784.
The previous prime is 212132003. The next prime is 212132021. The reversal of 212132013 is 310231212.
It is a cyclic number.
It is not a de Polignac number, because 212132013 - 29 = 212131501 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 212131983 and 212132001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212132003) 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 15 ways as a sum of consecutive naturals, for example, 51006 + ... + 55007.
It is an arithmetic number, because the mean of its divisors is an integer number (19082520).
Almost surely, 2212132013 is an apocalyptic number.
212132013 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
212132013 is a deficient number, since it is larger than the sum of its proper divisors (93188307).
212132013 is a wasteful number, since it uses less digits than its factorization.
212132013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106068.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 212132013 is about 14564.7524180811. The cubic root of 212132013 is about 596.3969370954.
Adding to 212132013 its reverse (310231212), we get a palindrome (522363225).
The spelling of 212132013 in words is "two hundred twelve million, one hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •