Base | Representation |
---|---|
bin | 10011001111101110… |
… | …101110010001100100 |
3 | 1222100011211211012122 |
4 | 103033232232101210 |
5 | 314310220013220 |
6 | 13254322405112 |
7 | 1331045416334 |
oct | 231756562144 |
9 | 58304754178 |
10 | 20665001060 |
11 | 8844944180 |
12 | 4008800798 |
13 | 1c443b18a2 |
14 | 100074d0c4 |
15 | 80e328425 |
hex | 4cfbae464 |
20665001060 has 48 divisors (see below), whose sum is σ = 48442629312. Its totient is φ = 7339785600.
The previous prime is 20665001039. The next prime is 20665001081. The reversal of 20665001060 is 6010056602.
It is an interprime number because it is at equal distance from previous prime (20665001039) and next prime (20665001081).
It is a super-2 number, since 2×206650010602 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1082771 + ... + 1101690.
It is an arithmetic number, because the mean of its divisors is an integer number (1009221444).
Almost surely, 220665001060 is an apocalyptic number.
20665001060 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20665001060 is an abundant number, since it is smaller than the sum of its proper divisors (27777628252).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20665001060 is a wasteful number, since it uses less digits than its factorization.
20665001060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2184524 (or 2184522 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 20665001060 its reverse (6010056602), we get a palindrome (26675057662).
The spelling of 20665001060 in words is "twenty billion, six hundred sixty-five million, one thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •