| Base | Representation |
|---|---|
| bin | 1001000110000110111100… |
| … | …11101110111010110001000 |
| 3 | 2121211002100001111102112020 |
| 4 | 10203003132131313112020 |
| 5 | 10110144223111213000 |
| 6 | 110312213433044440 |
| 7 | 4133013622515264 |
| oct | 443033635672610 |
| 9 | 77732301442466 |
| 10 | 20001100101000 |
| 11 | 6411467641217 |
| 12 | 22b041bb56720 |
| 13 | b2113219b685 |
| 14 | 4d20b63c50a4 |
| 15 | 24a41b73bba0 |
| hex | 1230de777588 |
20001100101000 has 512 divisors, whose sum is σ = 67678249766400. Its totient is φ = 4900671590400.
The previous prime is 20001100100957. The next prime is 20001100101029. The reversal of 20001100101000 is 10100110002.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a self number, because there is not a number n which added to its sum of digits gives 20001100101000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 668538042 + ... + 668567958.
It is an arithmetic number, because the mean of its divisors is an integer number (132184081575).
Almost surely, 220001100101000 is an apocalyptic number.
20001100101000 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 20001100101000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33839124883200).
20001100101000 is an abundant number, since it is smaller than the sum of its proper divisors (47677149665400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20001100101000 is a wasteful number, since it uses less digits than its factorization.
20001100101000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30314 (or 30300 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 20001100101000 its reverse (10100110002), we get a palindrome (20011200211002).
It can be divided in two parts, 20001 and 100101000, that added together give a palindrome (100121001).
The spelling of 20001100101000 in words is "twenty trillion, one billion, one hundred million, one hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •