Base | Representation |
---|---|
bin | 1100010110111101100… |
… | …1000010011110101000 |
3 | 202022001002201221100222 |
4 | 3011233121002132220 |
5 | 11434313442412412 |
6 | 241312310145212 |
7 | 21224354124215 |
oct | 3055731023650 |
9 | 668032657328 |
10 | 212322232232 |
11 | 82055401700 |
12 | 35196352208 |
13 | 17039166c56 |
14 | a3c281cb0c |
15 | 57ca146072 |
hex | 316f6427a8 |
212322232232 has 48 divisors (see below), whose sum is σ = 460616452800. Its totient is φ = 91430618400.
The previous prime is 212322232229. The next prime is 212322232261. The reversal of 212322232232 is 232232223212.
212322232232 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5753744 + ... + 5790527.
It is an arithmetic number, because the mean of its divisors is an integer number (9596176100).
Almost surely, 2212322232232 is an apocalyptic number.
212322232232 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
212322232232 is an abundant number, since it is smaller than the sum of its proper divisors (248294220568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212322232232 is a wasteful number, since it uses less digits than its factorization.
212322232232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11544318 (or 11544303 counting only the distinct ones).
The product of its digits is 6912, while the sum is 26.
Adding to 212322232232 its reverse (232232223212), we get a palindrome (444554455444).
The spelling of 212322232232 in words is "two hundred twelve billion, three hundred twenty-two million, two hundred thirty-two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •