Base | Representation |
---|---|
bin | 10011001011111000… |
… | …110100111101001000 |
3 | 1222011200112220122000 |
4 | 103023320310331020 |
5 | 314142214303000 |
6 | 13244101031000 |
7 | 1326333465204 |
oct | 231370647510 |
9 | 58150486560 |
10 | 20600541000 |
11 | 88115173a6 |
12 | 3bab0b5460 |
13 | 1c33c32840 |
14 | dd5d6db04 |
15 | 808844000 |
hex | 4cbe34f48 |
20600541000 has 512 divisors, whose sum is σ = 80982720000. Its totient is φ = 4802457600.
The previous prime is 20600540999. The next prime is 20600541079. The reversal of 20600541000 is 14500602.
It is a happy number.
20600541000 is a `hidden beast` number, since 2 + 0 + 600 + 54 + 10 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 6667456 + ... + 6670544.
It is an arithmetic number, because the mean of its divisors is an integer number (158169375).
Almost surely, 220600541000 is an apocalyptic number.
20600541000 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 20600541000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40491360000).
20600541000 is an abundant number, since it is smaller than the sum of its proper divisors (60382179000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20600541000 is a wasteful number, since it uses less digits than its factorization.
20600541000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3151 (or 3131 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The spelling of 20600541000 in words is "twenty billion, six hundred million, five hundred forty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •