Base | Representation |
---|---|
bin | 10111011001110011… |
… | …01100011110110000 |
3 | 1012102122021211001000 |
4 | 23230321230132300 |
5 | 201213001410333 |
6 | 5434432242000 |
7 | 623234222523 |
oct | 135471543660 |
9 | 35378254030 |
10 | 12564481968 |
11 | 53683602a5 |
12 | 25279a0300 |
13 | 12530a591c |
14 | 87299abba |
15 | 4d80c4713 |
hex | 2ece6c7b0 |
12564481968 has 60 divisors (see below), whose sum is σ = 36071405320. Its totient is φ = 4187384064.
The previous prime is 12564481967. The next prime is 12564482011. The reversal of 12564481968 is 86918446521.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
12564481968 is a `hidden beast` number, since 1 + 2 + 5 + 6 + 448 + 196 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (12564481961) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2327080 + ... + 2332472.
Almost surely, 212564481968 is an apocalyptic number.
12564481968 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
12564481968 is an abundant number, since it is smaller than the sum of its proper divisors (23506923352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12564481968 is an frugal number, since it uses more digits than its factorization.
12564481968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10803 (or 5398 counting only the distinct ones).
The product of its digits is 3317760, while the sum is 54.
The spelling of 12564481968 in words is "twelve billion, five hundred sixty-four million, four hundred eighty-one thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •