Base | Representation |
---|---|
bin | 10010101001101001… |
… | …001000010010110000 |
3 | 1220200122110020022110 |
4 | 102221221020102300 |
5 | 312003124004220 |
6 | 13111054405320 |
7 | 1306156124166 |
oct | 225151102260 |
9 | 56618406273 |
10 | 20026000560 |
11 | 8547178695 |
12 | 3a6a800840 |
13 | 1b71bac397 |
14 | d7d933236 |
15 | 7c31a4be0 |
hex | 4a9a484b0 |
20026000560 has 80 divisors (see below), whose sum is σ = 62124238080. Its totient is φ = 5336513280.
The previous prime is 20026000529. The next prime is 20026000591. The reversal of 20026000560 is 6500062002.
It is an interprime number because it is at equal distance from previous prime (20026000529) and next prime (20026000591).
It is a tau number, because it is divible by the number of its divisors (80).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 321565 + ... + 378755.
It is an arithmetic number, because the mean of its divisors is an integer number (776552976).
Almost surely, 220026000560 is an apocalyptic number.
20026000560 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20026000560 is an abundant number, since it is smaller than the sum of its proper divisors (42098237520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20026000560 is a wasteful number, since it uses less digits than its factorization.
20026000560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58666 (or 58660 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 21.
Adding to 20026000560 its reverse (6500062002), we get a palindrome (26526062562).
The spelling of 20026000560 in words is "twenty billion, twenty-six million, five hundred sixty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •