Base | Representation |
---|---|
bin | 10010101111001111… |
… | …101111110011111100 |
3 | 1220221012100101222211 |
4 | 102233033233303330 |
5 | 312201210304410 |
6 | 13124253350204 |
7 | 1311410156140 |
oct | 225717576374 |
9 | 56835311884 |
10 | 20120009980 |
11 | 8595248324 |
12 | 3a96198364 |
13 | 1b88506265 |
14 | d8c205220 |
15 | 7cb57468a |
hex | 4af3efcfc |
20120009980 has 96 divisors (see below), whose sum is σ = 50071633920. Its totient is φ = 6645507840.
The previous prime is 20120009953. The next prime is 20120009981. The reversal of 20120009980 is 8990002102.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20120009981) 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, 957426 + ... + 978214.
It is an arithmetic number, because the mean of its divisors is an integer number (521579520).
Almost surely, 220120009980 is an apocalyptic number.
20120009980 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 20120009980, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25035816960).
20120009980 is an abundant number, since it is smaller than the sum of its proper divisors (29951623940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20120009980 is a wasteful number, since it uses less digits than its factorization.
20120009980 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21059 (or 21057 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 31.
The spelling of 20120009980 in words is "twenty billion, one hundred twenty million, nine thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •