Base | Representation |
---|---|
bin | 10010101110101010… |
… | …110010110100111000 |
3 | 1220220112010020221210 |
4 | 102232222302310320 |
5 | 312141220314000 |
6 | 13123310003120 |
7 | 1311231632205 |
oct | 225652626470 |
9 | 56815106853 |
10 | 20110323000 |
11 | 858a831359 |
12 | 3a92aa64a0 |
13 | 1b864c4011 |
14 | d8ac02cac |
15 | 7ca7ae350 |
hex | 4aeab2d38 |
20110323000 has 128 divisors (see below), whose sum is σ = 63239454720. Its totient is φ = 5320425600.
The previous prime is 20110322993. The next prime is 20110323031. The reversal of 20110323000 is 32301102.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
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, 354609 + ... + 407391.
It is an arithmetic number, because the mean of its divisors is an integer number (494058240).
Almost surely, 220110323000 is an apocalyptic number.
20110323000 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 20110323000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31619727360).
20110323000 is an abundant number, since it is smaller than the sum of its proper divisors (43129131720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20110323000 is a wasteful number, since it uses less digits than its factorization.
20110323000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52934 (or 52920 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 20110323000 its reverse (32301102), we get a palindrome (20142624102).
The spelling of 20110323000 in words is "twenty billion, one hundred ten million, three hundred twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •