Base | Representation |
---|---|
bin | 10011011101110111… |
… | …000001100100101000 |
3 | 1222221200220120120200 |
4 | 103131313001210220 |
5 | 320301411331110 |
6 | 13334031352200 |
7 | 1336654364265 |
oct | 233567014450 |
9 | 58850816520 |
10 | 20902058280 |
11 | 8956737834 |
12 | 4074082660 |
13 | 1c8154212c |
14 | 102401a26c |
15 | 8250526c0 |
hex | 4dddc1928 |
20902058280 has 192 divisors, whose sum is σ = 72448084800. Its totient is φ = 5208053760.
The previous prime is 20902058279. The next prime is 20902058321. The reversal of 20902058280 is 8285020902.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 838395 + ... + 862965.
It is an arithmetic number, because the mean of its divisors is an integer number (377333775).
Almost surely, 220902058280 is an apocalyptic number.
20902058280 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 20902058280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36224042400).
20902058280 is an abundant number, since it is smaller than the sum of its proper divisors (51546026520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20902058280 is a wasteful number, since it uses less digits than its factorization.
20902058280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24744 (or 24737 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 36.
The spelling of 20902058280 in words is "twenty billion, nine hundred two million, fifty-eight thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •