Base | Representation |
---|---|
bin | 10010101000001001… |
… | …100001001011000000 |
3 | 1220121220021212002010 |
4 | 102220021201023000 |
5 | 311430214433030 |
6 | 13104401252520 |
7 | 1305433104426 |
oct | 225011411300 |
9 | 56556255063 |
10 | 20000936640 |
11 | 8534009803 |
12 | 3a62334140 |
13 | 1b69945069 |
14 | d7a48b116 |
15 | 7c0da36b0 |
hex | 4a82612c0 |
20000936640 has 112 divisors (see below), whose sum is σ = 63569709792. Its totient is φ = 5327978496.
The previous prime is 20000936629. The next prime is 20000936671. The reversal of 20000936640 is 4663900002.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 20000936598 and 20000936607.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 946672 + ... + 967568.
Almost surely, 220000936640 is an apocalyptic number.
20000936640 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 20000936640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31784854896).
20000936640 is an abundant number, since it is smaller than the sum of its proper divisors (43568773152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20000936640 is a wasteful number, since it uses less digits than its factorization.
20000936640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21914 (or 21904 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 30.
The spelling of 20000936640 in words is "twenty billion, nine hundred thirty-six thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •