Base | Representation |
---|---|
bin | 1100001110101011101… |
… | …1111001010100000000 |
3 | 202002022020012211211111 |
4 | 3003222323321110000 |
5 | 11420241100000000 |
6 | 240304004053104 |
7 | 21115321351102 |
oct | 3035273712400 |
9 | 662266184744 |
10 | 210100000000 |
11 | 81114a77740 |
12 | 34876094194 |
13 | 16a73950137 |
14 | a251635572 |
15 | 56e9ed6cba |
hex | 30eaef9500 |
210100000000 has 324 divisors, whose sum is σ = 574874705664. Its totient is φ = 76000000000.
The previous prime is 210099999997. The next prime is 210100000001. The reversal of 210100000000 is 1012.
It is a Harshad number since it is a multiple of its sum of digits (4).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210100000001) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1099999905 + ... + 1100000095.
Almost surely, 2210100000000 is an apocalyptic number.
210100000000 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 210100000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (287437352832).
210100000000 is an abundant number, since it is smaller than the sum of its proper divisors (364774705664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210100000000 is an frugal number, since it uses more digits than its factorization.
210100000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 258 (or 209 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 4.
Adding to 210100000000 its reverse (1012), we get a palindrome (210100001012).
The spelling of 210100000000 in words is "two hundred ten billion, one hundred million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •