Base | Representation |
---|---|
bin | 10010101000111100… |
… | …101001011110100000 |
3 | 1220122211111211000212 |
4 | 102220330221132200 |
5 | 311442132340000 |
6 | 13110000433252 |
7 | 1305655040324 |
oct | 225074513640 |
9 | 56584454025 |
10 | 20014340000 |
11 | 8540633966 |
12 | 3a66918828 |
13 | 1b6c658a45 |
14 | d7c179984 |
15 | 7c214ec35 |
hex | 4a8f297a0 |
20014340000 has 120 divisors (see below), whose sum is σ = 49375997748. Its totient is φ = 7983360000.
The previous prime is 20014339997. The next prime is 20014340009. The reversal of 20014340000 is 4341002.
It can be written as a sum of positive squares in 10 ways, for example, as 8200389136 + 11813950864 = 90556^2 + 108692^2 .
It is not an unprimeable number, because it can be changed into a prime (20014340009) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 8418812 + ... + 8421188.
Almost surely, 220014340000 is an apocalyptic number.
20014340000 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 20014340000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24687998874).
20014340000 is an abundant number, since it is smaller than the sum of its proper divisors (29361657748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20014340000 is an equidigital number, since it uses as much as digits as its factorization.
20014340000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2828 (or 2805 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 14.
Adding to 20014340000 its reverse (4341002), we get a palindrome (20018681002).
The spelling of 20014340000 in words is "twenty billion, fourteen million, three hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •