Base | Representation |
---|---|
bin | 1100010110001101011… |
… | …0010110111100011000 |
3 | 202021112000120210102000 |
4 | 3011203112112330120 |
5 | 11433410232444112 |
6 | 241240252041000 |
7 | 21216351655623 |
oct | 3054326267430 |
9 | 667460523360 |
10 | 212120203032 |
11 | 81a61363121 |
12 | 3513a763160 |
13 | 1700634c14a |
14 | a3a3a6cdba |
15 | 57b753a7dc |
hex | 3163596f18 |
212120203032 has 32 divisors (see below), whose sum is σ = 589222786800. Its totient is φ = 70706734272.
The previous prime is 212120203007. The next prime is 212120203063. The reversal of 212120203032 is 230302021212.
212120203032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 212120202996 and 212120203014.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 491018773 + ... + 491019204.
Almost surely, 2212120203032 is an apocalyptic number.
It is an amenable number.
212120203032 is an abundant number, since it is smaller than the sum of its proper divisors (377102583768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212120203032 is a wasteful number, since it uses less digits than its factorization.
212120203032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 982037992 (or 982037982 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 212120203032 its reverse (230302021212), we get a palindrome (442422224244).
The spelling of 212120203032 in words is "two hundred twelve billion, one hundred twenty million, two hundred three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •