Base | Representation |
---|---|
bin | 10010101110101010… |
… | …110010101010010000 |
3 | 1220220112010020000121 |
4 | 102232222302222100 |
5 | 312141220303240 |
6 | 13123310000024 |
7 | 1311231630214 |
oct | 225652625220 |
9 | 56815106017 |
10 | 20110322320 |
11 | 858a8308a0 |
12 | 3a92aa6014 |
13 | 1b864c390a |
14 | d8ac02944 |
15 | 7ca7ae04a |
hex | 4aeab2a90 |
20110322320 has 160 divisors (see below), whose sum is σ = 53870552064. Its totient is φ = 6910041600.
The previous prime is 20110322317. The next prime is 20110322359. The reversal of 20110322320 is 2322301102.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 20110322294 and 20110322303.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1673935 + ... + 1685905.
Almost surely, 220110322320 is an apocalyptic number.
20110322320 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 20110322320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26935276032).
20110322320 is an abundant number, since it is smaller than the sum of its proper divisors (33760229744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20110322320 is a wasteful number, since it uses less digits than its factorization.
20110322320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12101 (or 12095 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 20110322320 its reverse (2322301102), we get a palindrome (22432623422).
The spelling of 20110322320 in words is "twenty billion, one hundred ten million, three hundred twenty-two thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •