Base | Representation |
---|---|
bin | 1100010110001001000… |
… | …1010101101100110000 |
3 | 202021110202112120102201 |
4 | 3011202101111230300 |
5 | 11433341120010000 |
6 | 241234404152544 |
7 | 21216042121354 |
oct | 3054221255460 |
9 | 667422476381 |
10 | 212102110000 |
11 | 81a52125600 |
12 | 35134698754 |
13 | 17002685a01 |
14 | a3a14bd464 |
15 | 57b5b6496a |
hex | 3162455b30 |
212102110000 has 150 divisors (see below), whose sum is σ = 564451283396. Its totient is φ = 77127600000.
The previous prime is 212102109979. The next prime is 212102110001. The reversal of 212102110000 is 11201212.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (212102110001) by changing a digit.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 1122355 + ... + 1297645.
Almost surely, 2212102110000 is an apocalyptic number.
212102110000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 212102110000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (282225641698).
212102110000 is an abundant number, since it is smaller than the sum of its proper divisors (352349173396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212102110000 is a wasteful number, since it uses less digits than its factorization.
212102110000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 175341 (or 175309 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 212102110000 its reverse (11201212), we get a palindrome (212113311212).
The spelling of 212102110000 in words is "two hundred twelve billion, one hundred two million, one hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •