Base | Representation |
---|---|
bin | 100110010110… |
… | …1101010110000 |
3 | 1101211200201211 |
4 | 1030231222300 |
5 | 20122010000 |
6 | 1555005504 |
7 | 332634511 |
oct | 114555260 |
9 | 41750654 |
10 | 20110000 |
11 | 10395a39 |
12 | 6899894 |
13 | 4221511 |
14 | 2956a08 |
15 | 1b737ba |
hex | 132dab0 |
20110000 has 50 divisors (see below), whose sum is σ = 48712532. Its totient is φ = 8040000.
The previous prime is 20109989. The next prime is 20110043. The reversal of 20110000 is 1102.
It is a tau number, because it is divible by the number of its divisors (50).
It is a Harshad number since it is a multiple of its sum of digits (4).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 8995 + ... + 11005.
Almost surely, 220110000 is an apocalyptic number.
20110000 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 20110000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24356266).
20110000 is an abundant number, since it is smaller than the sum of its proper divisors (28602532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20110000 is an equidigital number, since it uses as much as digits as its factorization.
20110000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2039 (or 2018 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 4.
The square root of 20110000 is about 4484.4174649557. The cubic root of 20110000 is about 271.9384953208.
Adding to 20110000 its reverse (1102), we get a palindrome (20111102).
It can be divided in two parts, 201 and 10000, that added together give a palindrome (10201).
The spelling of 20110000 in words is "twenty million, one hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •