Base | Representation |
---|---|
bin | 1100010101110101110… |
… | …0010111000100010110 |
3 | 202021021010010111120220 |
4 | 3011131130113010112 |
5 | 11433204401104420 |
6 | 241222352135210 |
7 | 21214036504002 |
oct | 3053534270426 |
9 | 667233114526 |
10 | 212021113110 |
11 | 81a10433424 |
12 | 35111537506 |
13 | 16cbb966961 |
14 | a394837702 |
15 | 57ad9b5840 |
hex | 315d717116 |
212021113110 has 64 divisors (see below), whose sum is σ = 514719194112. Its totient is φ = 55889197056.
The previous prime is 212021113079. The next prime is 212021113163. The reversal of 212021113110 is 11311120212.
212021113110 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 (15).
It is a self number, because there is not a number n which added to its sum of digits gives 212021113110.
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 31 ways as a sum of consecutive naturals, for example, 1414902 + ... + 1557558.
It is an arithmetic number, because the mean of its divisors is an integer number (8042487408).
Almost surely, 2212021113110 is an apocalyptic number.
212021113110 is an abundant number, since it is smaller than the sum of its proper divisors (302698081002).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212021113110 is a wasteful number, since it uses less digits than its factorization.
212021113110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143237.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 212021113110 its reverse (11311120212), we get a palindrome (223332233322).
The spelling of 212021113110 in words is "two hundred twelve billion, twenty-one million, one hundred thirteen thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •