Base | Representation |
---|---|
bin | 10011000111101011… |
… | …110000011001100000 |
3 | 1221222202211100020210 |
4 | 103013223300121200 |
5 | 314021140134400 |
6 | 13233101134120 |
7 | 1324516111506 |
oct | 230753603140 |
9 | 57882740223 |
10 | 20530005600 |
11 | 8785720085 |
12 | 3b8b55a340 |
13 | 1c22437410 |
14 | dca84c676 |
15 | 80255e950 |
hex | 4c7af0660 |
20530005600 has 288 divisors, whose sum is σ = 72529357824. Its totient is φ = 5013964800.
The previous prime is 20530005599. The next prime is 20530005607. The reversal of 20530005600 is 650003502.
It is a super-2 number, since 2×205300056002 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20530005607) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4084689 + ... + 4089711.
It is an arithmetic number, because the mean of its divisors is an integer number (251838048).
Almost surely, 220530005600 is an apocalyptic number.
20530005600 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 20530005600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36264678912).
20530005600 is an abundant number, since it is smaller than the sum of its proper divisors (51999352224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20530005600 is a wasteful number, since it uses less digits than its factorization.
20530005600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5190 (or 5177 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 21.
The spelling of 20530005600 in words is "twenty billion, five hundred thirty million, five thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •