Base | Representation |
---|---|
bin | 1100010110100010110… |
… | …1010100111001000100 |
3 | 202021202021202112121110 |
4 | 3011220231110321010 |
5 | 11434101242010040 |
6 | 241253223045020 |
7 | 21221523113256 |
oct | 3055055247104 |
9 | 667667675543 |
10 | 212210110020 |
11 | 81aa8090617 |
12 | 351648a0770 |
13 | 1701bb6a94c |
14 | a3b1993cd6 |
15 | 57c0399980 |
hex | 3168b54e44 |
212210110020 has 96 divisors (see below), whose sum is σ = 624928711680. Its totient is φ = 53730593280.
The previous prime is 212210109973. The next prime is 212210110061. The reversal of 212210110020 is 20011012212.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 212210109978 and 212210110005.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 977755 + ... + 1174914.
It is an arithmetic number, because the mean of its divisors is an integer number (6509674080).
Almost surely, 2212210110020 is an apocalyptic number.
212210110020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212210110020 is an abundant number, since it is smaller than the sum of its proper divisors (412718601660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212210110020 is a wasteful number, since it uses less digits than its factorization.
212210110020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2152765 (or 2152763 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 212210110020 its reverse (20011012212), we get a palindrome (232221122232).
The spelling of 212210110020 in words is "two hundred twelve billion, two hundred ten million, one hundred ten thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •