Base | Representation |
---|---|
bin | 1100010110001010111… |
… | …1110100101000001000 |
3 | 202021111022120120000200 |
4 | 3011202233310220020 |
5 | 11433400141213000 |
6 | 241235251332200 |
7 | 21216200052630 |
oct | 3054257645010 |
9 | 667438516020 |
10 | 212110101000 |
11 | 81a56693336 |
12 | 351372b1060 |
13 | 17004223005 |
14 | a3a259d6c0 |
15 | 57b66e2500 |
hex | 3162bf4a08 |
212110101000 has 192 divisors, whose sum is σ = 819351262080. Its totient is φ = 48482294400.
The previous prime is 212110100989. The next prime is 212110101023. The reversal of 212110101000 is 101011212.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
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 47 ways as a sum of consecutive naturals, for example, 1620414 + ... + 1746413.
It is an arithmetic number, because the mean of its divisors is an integer number (4267454490).
Almost surely, 2212110101000 is an apocalyptic number.
212110101000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212110101000 is an abundant number, since it is smaller than the sum of its proper divisors (607241161080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212110101000 is a wasteful number, since it uses less digits than its factorization.
212110101000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3366861 (or 3366844 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 212110101000 its reverse (101011212), we get a palindrome (212211112212).
The spelling of 212110101000 in words is "two hundred twelve billion, one hundred ten million, one hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •