Base | Representation |
---|---|
bin | 10011100000010010… |
… | …011110000000000000 |
3 | 2000001112120211101000 |
4 | 103200102132000000 |
5 | 320342324311130 |
6 | 13342045012000 |
7 | 1340660631321 |
oct | 234022360000 |
9 | 60045524330 |
10 | 20942807040 |
11 | 89777399a1 |
12 | 4085854000 |
13 | 1c89b0b71c |
14 | 10295c6448 |
15 | 828901260 |
hex | 4e049e000 |
20942807040 has 448 divisors, whose sum is σ = 77144270400. Its totient is φ = 5383913472.
The previous prime is 20942807009. The next prime is 20942807047. The reversal of 20942807040 is 4070824902.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 20942806986 and 20942807004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20942807047) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 32071354 + ... + 32072006.
Almost surely, 220942807040 is an apocalyptic number.
20942807040 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 20942807040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38572135200).
20942807040 is an abundant number, since it is smaller than the sum of its proper divisors (56201463360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20942807040 is an equidigital number, since it uses as much as digits as its factorization.
20942807040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 722 (or 692 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 36.
The spelling of 20942807040 in words is "twenty billion, nine hundred forty-two million, eight hundred seven thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.184 sec. • engine limits •