Base | Representation |
---|---|
bin | 11001010011011… |
… | …10010101111000 |
3 | 112210102010220012 |
4 | 30221232111320 |
5 | 413314424222 |
6 | 33021321052 |
7 | 5155134251 |
oct | 1451562570 |
9 | 483363805 |
10 | 212264312 |
11 | a98aa357 |
12 | 5b106188 |
13 | 34c8c6b0 |
14 | 20295b28 |
15 | 1397d1e2 |
hex | ca6e578 |
212264312 has 64 divisors (see below), whose sum is σ = 456775200. Its totient is φ = 91607040.
The previous prime is 212264287. The next prime is 212264317. The reversal of 212264312 is 213462212.
It is a happy number.
212264312 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2122643122 = 90112276297666688, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212264317) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 372764 + ... + 373332.
Almost surely, 2212264312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 212264312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (228387600).
212264312 is an abundant number, since it is smaller than the sum of its proper divisors (244510888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212264312 is a wasteful number, since it uses less digits than its factorization.
212264312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 816 (or 812 counting only the distinct ones).
The product of its digits is 1152, while the sum is 23.
The square root of 212264312 is about 14569.2934626220. The cubic root of 212264312 is about 596.5208950026.
The spelling of 212264312 in words is "two hundred twelve million, two hundred sixty-four thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •