Base | Representation |
---|---|
bin | 10010101001011110… |
… | …010000111011000000 |
3 | 1220200110002112021002 |
4 | 102221132100323000 |
5 | 312001411333240 |
6 | 13110513351132 |
7 | 1306122662243 |
oct | 225136207300 |
9 | 56613075232 |
10 | 20023152320 |
11 | 8545602776 |
12 | 3a698684a8 |
13 | 1b71422b32 |
14 | d7d3d125a |
15 | 7c2ce0d15 |
hex | 4a9790ec0 |
20023152320 has 112 divisors (see below), whose sum is σ = 49965742080. Its totient is φ = 7628307456.
The previous prime is 20023152319. The next prime is 20023152349. The reversal of 20023152320 is 2325132002.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 20023152292 and 20023152301.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1753349 + ... + 1764731.
Almost surely, 220023152320 is an apocalyptic number.
20023152320 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 20023152320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24982871040).
20023152320 is an abundant number, since it is smaller than the sum of its proper divisors (29942589760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20023152320 is a wasteful number, since it uses less digits than its factorization.
20023152320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11662 (or 11652 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 20.
Adding to 20023152320 its reverse (2325132002), we get a palindrome (22348284322).
The spelling of 20023152320 in words is "twenty billion, twenty-three million, one hundred fifty-two thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •