Base | Representation |
---|---|
bin | 10010101111010100… |
… | …101110001111000000 |
3 | 1220221021210200002202 |
4 | 102233110232033000 |
5 | 312202024023430 |
6 | 13124341332332 |
7 | 1311424230506 |
oct | 225724561700 |
9 | 56837720082 |
10 | 20121314240 |
11 | 8595a59225 |
12 | 3a967070a8 |
13 | 1b88871b01 |
14 | d8c464676 |
15 | 7cb730d45 |
hex | 4af52e3c0 |
20121314240 has 56 divisors (see below), whose sum is σ = 50732356752. Its totient is φ = 7575080960.
The previous prime is 20121314221. The next prime is 20121314249. The reversal of 20121314240 is 4241312102.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20121314249) 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 7 ways as a sum of consecutive naturals, for example, 1843946 + ... + 1854825.
It is an arithmetic number, because the mean of its divisors is an integer number (905934942).
Almost surely, 220121314240 is an apocalyptic number.
20121314240 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20121314240 is an abundant number, since it is smaller than the sum of its proper divisors (30611042512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20121314240 is a wasteful number, since it uses less digits than its factorization.
20121314240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3698805 (or 3698795 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 20121314240 its reverse (4241312102), we get a palindrome (24362626342).
The spelling of 20121314240 in words is "twenty billion, one hundred twenty-one million, three hundred fourteen thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •