Base | Representation |
---|---|
bin | 10111100010110101… |
… | …10101110111001101 |
3 | 1012121220220202102000 |
4 | 23301122311313031 |
5 | 201341402430023 |
6 | 5450141022513 |
7 | 625144415214 |
oct | 136132656715 |
9 | 35556822360 |
10 | 12640280013 |
11 | 53a7121509 |
12 | 2549254a39 |
13 | 12659c453a |
14 | 87ca8c07b |
15 | 4dea98243 |
hex | 2f16b5dcd |
12640280013 has 8 divisors (see below), whose sum is σ = 18726340800. Its totient is φ = 8426853324.
The previous prime is 12640279999. The next prime is 12640280017. The reversal of 12640280013 is 31008204621.
12640280013 is a `hidden beast` number, since 1 + 2 + 640 + 2 + 8 + 0 + 0 + 13 = 666.
It is not a de Polignac number, because 12640280013 - 212 = 12640275917 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 468158519 = 12640280013 / (1 + 2 + 6 + 4 + 0 + 2 + 8 + 0 + 0 + 1 + 3).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12640280017) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 234079233 + ... + 234079286.
It is an arithmetic number, because the mean of its divisors is an integer number (2340792600).
Almost surely, 212640280013 is an apocalyptic number.
It is an amenable number.
12640280013 is a deficient number, since it is larger than the sum of its proper divisors (6086060787).
12640280013 is an equidigital number, since it uses as much as digits as its factorization.
12640280013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 468158528 (or 468158522 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
Adding to 12640280013 its reverse (31008204621), we get a palindrome (43648484634).
The spelling of 12640280013 in words is "twelve billion, six hundred forty million, two hundred eighty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •