Base | Representation |
---|---|
bin | 10011001101001101… |
… | …000011010101100000 |
3 | 1222020020002122022202 |
4 | 103031031003111200 |
5 | 314213342320000 |
6 | 13250210152332 |
7 | 1330022243363 |
oct | 231515032540 |
9 | 58206078282 |
10 | 20622620000 |
11 | 8822a27704 |
12 | 3bb65826a8 |
13 | 1c38693338 |
14 | dd8c7a0da |
15 | 80a755dd5 |
hex | 4cd343560 |
20622620000 has 120 divisors (see below), whose sum is σ = 50836539600. Its totient is φ = 8232512000.
The previous prime is 20622619999. The next prime is 20622620009. The reversal of 20622620000 is 2622602.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20622620009) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 16779386 + ... + 16780614.
It is an arithmetic number, because the mean of its divisors is an integer number (423637830).
Almost surely, 220622620000 is an apocalyptic number.
20622620000 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 20622620000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25418269800).
20622620000 is an abundant number, since it is smaller than the sum of its proper divisors (30213919600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20622620000 is an equidigital number, since it uses as much as digits as its factorization.
20622620000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2098 (or 2075 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
The spelling of 20622620000 in words is "twenty billion, six hundred twenty-two million, six hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •