Base | Representation |
---|---|
bin | 10111010011110010… |
… | …01011110010010000 |
3 | 1012022010022220021220 |
4 | 23221321023302100 |
5 | 201112042011100 |
6 | 5425430445040 |
7 | 622052245554 |
oct | 135171136220 |
9 | 35263286256 |
10 | 12514016400 |
11 | 5341921816 |
12 | 2512b03780 |
13 | 12457b6642 |
14 | 869dc1864 |
15 | 4d3956aa0 |
hex | 2e9e4bc90 |
12514016400 has 60 divisors (see below), whose sum is σ = 40086569712. Its totient is φ = 3337070720.
The previous prime is 12514016371. The next prime is 12514016423. The reversal of 12514016400 is 461041521.
It is a happy number.
12514016400 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (60).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 5212974 + ... + 5215373.
Almost surely, 212514016400 is an apocalyptic number.
12514016400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12514016400 is an abundant number, since it is smaller than the sum of its proper divisors (27572553312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12514016400 is a wasteful number, since it uses less digits than its factorization.
12514016400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10428368 (or 10428357 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 24.
Adding to 12514016400 its reverse (461041521), we get a palindrome (12975057921).
The spelling of 12514016400 in words is "twelve billion, five hundred fourteen million, sixteen thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •