Base | Representation |
---|---|
bin | 10010101110111000… |
… | …111000011100110000 |
3 | 1220220210001212212100 |
4 | 102232320320130300 |
5 | 312143142003143 |
6 | 13123521100400 |
7 | 1311305213130 |
oct | 225670703460 |
9 | 56823055770 |
10 | 20114016048 |
11 | 8591923a65 |
12 | 3a94187700 |
13 | 1b871b7c59 |
14 | d8b4c4ac0 |
15 | 7cac8d6d3 |
hex | 4aee38730 |
20114016048 has 240 divisors, whose sum is σ = 65637622336. Its totient is φ = 5631068160.
The previous prime is 20114016029. The next prime is 20114016049. The reversal of 20114016048 is 84061041102.
It is a happy number.
20114016048 is a `hidden beast` number, since 2 + 0 + 11 + 40 + 1 + 604 + 8 = 666.
It is not an unprimeable number, because it can be changed into a prime (20114016049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 22934586 + ... + 22935462.
Almost surely, 220114016048 is an apocalyptic number.
20114016048 is a gapful number since it is divisible by the number (28) 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 20114016048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32818811168).
20114016048 is an abundant number, since it is smaller than the sum of its proper divisors (45523606288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20114016048 is a wasteful number, since it uses less digits than its factorization.
20114016048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1332 (or 1323 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
The spelling of 20114016048 in words is "twenty billion, one hundred fourteen million, sixteen thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •