Base | Representation |
---|---|
bin | 10010101101100000… |
… | …101000000000000000 |
3 | 1220212011112110011200 |
4 | 102231200220000000 |
5 | 312121231130000 |
6 | 13121333141200 |
7 | 1310604443112 |
oct | 225540500000 |
9 | 56764473150 |
10 | 20090880000 |
11 | 857a861564 |
12 | 3a8848a800 |
13 | 1b82477299 |
14 | d883c13b2 |
15 | 7c8c1d500 |
hex | 4ad828000 |
20090880000 has 480 divisors, whose sum is σ = 73191454050. Its totient is φ = 5308416000.
The previous prime is 20090879989. The next prime is 20090880001. The reversal of 20090880000 is 8809002.
It can be written as a sum of positive squares in 5 ways, for example, as 874266624 + 19216613376 = 29568^2 + 138624^2 .
It is a tau number, because it is divible by the number of its divisors (480).
It is not an unprimeable number, because it can be changed into a prime (20090880001) by changing a digit.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 184319946 + ... + 184320054.
Almost surely, 220090880000 is an apocalyptic number.
20090880000 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 20090880000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36595727025).
20090880000 is an abundant number, since it is smaller than the sum of its proper divisors (53100574050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20090880000 is an frugal number, since it uses more digits than its factorization.
20090880000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165 (or 119 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 27.
The spelling of 20090880000 in words is "twenty billion, ninety million, eight hundred eighty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •