Base | Representation |
---|---|
bin | 10011011011001111… |
… | …010100000000000000 |
3 | 1222211122011221100000 |
4 | 103123033110000000 |
5 | 320204132443233 |
6 | 13325421200000 |
7 | 1335611604264 |
oct | 233317240000 |
9 | 58748157300 |
10 | 20858093568 |
11 | 8933939464 |
12 | 4061400000 |
13 | 1c753bab00 |
14 | 101c2540a4 |
15 | 82126ad13 |
hex | 4db3d4000 |
20858093568 has 540 divisors, whose sum is σ = 69845612928. Its totient is φ = 6210846720.
The previous prime is 20858093567. The next prime is 20858093573. The reversal of 20858093568 is 86539085802.
20858093568 is a `hidden beast` number, since 2 + 0 + 8 + 580 + 9 + 3 + 56 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20858093563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 672841713 + ... + 672841743.
Almost surely, 220858093568 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20858093568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34922806464).
20858093568 is an abundant number, since it is smaller than the sum of its proper divisors (48987519360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20858093568 is an frugal number, since it uses more digits than its factorization.
20858093568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100 (or 49 counting only the distinct ones).
The product of its (nonzero) digits is 4147200, while the sum is 54.
The spelling of 20858093568 in words is "twenty billion, eight hundred fifty-eight million, ninety-three thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •