Base | Representation |
---|---|
bin | 1100001110101110100… |
… | …1101101101100000100 |
3 | 202002100001211001211210 |
4 | 3003223221231230010 |
5 | 11420302133323022 |
6 | 240305113331420 |
7 | 21115525424451 |
oct | 3035351555404 |
9 | 662301731753 |
10 | 210112011012 |
11 | 811208307a2 |
12 | 3487a106b70 |
13 | 16a76297147 |
14 | a253080828 |
15 | 56eb0aaa0c |
hex | 30eba6db04 |
210112011012 has 24 divisors (see below), whose sum is σ = 490300939296. Its totient is φ = 70031682688.
The previous prime is 210112011001. The next prime is 210112011019. The reversal of 210112011012 is 210110211012.
210112011012 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 (12).
It is not an unprimeable number, because it can be changed into a prime (210112011019) by changing a digit.
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, 550578 + ... + 850505.
It is an arithmetic number, because the mean of its divisors is an integer number (20429205804).
Almost surely, 2210112011012 is an apocalyptic number.
It is an amenable number.
210112011012 is an abundant number, since it is smaller than the sum of its proper divisors (280188928284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210112011012 is a wasteful number, since it uses less digits than its factorization.
210112011012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1413587 (or 1413585 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 210112011012 its reverse (210110211012), we get a palindrome (420222222024).
The spelling of 210112011012 in words is "two hundred ten billion, one hundred twelve million, eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •