Base | Representation |
---|---|
bin | 10010101110101010… |
… | …010111001111010000 |
3 | 1220220111220111221121 |
4 | 102232222113033100 |
5 | 312141203210000 |
6 | 13123303332024 |
7 | 1311230651566 |
oct | 225652271720 |
9 | 56814814847 |
10 | 20110210000 |
11 | 858a764471 |
12 | 3a92a51014 |
13 | 1b8648475a |
14 | d8abb3a36 |
15 | 7ca78ab1a |
hex | 4aea973d0 |
20110210000 has 50 divisors (see below), whose sum is σ = 48688853642. Its totient is φ = 8044080000.
The previous prime is 20110209991. The next prime is 20110210009. The reversal of 20110210000 is 1201102.
It is an interprime number because it is at equal distance from previous prime (20110209991) and next prime (20110210009).
It can be written as a sum of positive squares in 5 ways, for example, as 8586616896 + 11523593104 = 92664^2 + 107348^2 .
It is a tau number, because it is divible by the number of its divisors (50).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20110210009) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 995511 + ... + 1015510.
Almost surely, 220110210000 is an apocalyptic number.
20110210000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20110210000 is an abundant number, since it is smaller than the sum of its proper divisors (28578643642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20110210000 is an equidigital number, since it uses as much as digits as its factorization.
20110210000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2011049 (or 2011028 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 20110210000 its reverse (1201102), we get a palindrome (20111411102).
The spelling of 20110210000 in words is "twenty billion, one hundred ten million, two hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •