Base | Representation |
---|---|
bin | 10111010011000000… |
… | …10010000110000000 |
3 | 1012021200001020220000 |
4 | 23221200102012000 |
5 | 201103404114030 |
6 | 5425034520000 |
7 | 621642620313 |
oct | 135140220600 |
9 | 35250036800 |
10 | 12507488640 |
11 | 5339173379 |
12 | 2510896000 |
13 | 124433c36a |
14 | 8691a297a |
15 | 4d30b7860 |
hex | 2e9812180 |
12507488640 has 160 divisors (see below), whose sum is σ = 44666685360. Its totient is φ = 3335316480.
The previous prime is 12507488629. The next prime is 12507488641. The reversal of 12507488640 is 4688470521.
12507488640 is a `hidden beast` number, since 1 + 2 + 507 + 4 + 88 + 64 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (160).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12507488641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 68796 + ... + 172475.
Almost surely, 212507488640 is an apocalyptic number.
12507488640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12507488640 is an abundant number, since it is smaller than the sum of its proper divisors (32159196720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12507488640 is an equidigital number, since it uses as much as digits as its factorization.
12507488640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241302 (or 241281 counting only the distinct ones).
The product of its (nonzero) digits is 430080, while the sum is 45.
The spelling of 12507488640 in words is "twelve billion, five hundred seven million, four hundred eighty-eight thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •