Base | Representation |
---|---|
bin | 11000001100001111… |
… | …11100001000111000 |
3 | 1020112010112210200012 |
4 | 30012013330020320 |
5 | 203044314142040 |
6 | 5544430201052 |
7 | 636563113442 |
oct | 140607741070 |
9 | 36463483605 |
10 | 12987646520 |
11 | 5565208072 |
12 | 2625653188 |
13 | 12bc967b54 |
14 | 8b2c71492 |
15 | 510311865 |
hex | 3061fc238 |
12987646520 has 64 divisors (see below), whose sum is σ = 30252895200. Its totient is φ = 5012098560.
The previous prime is 12987646489. The next prime is 12987646541. The reversal of 12987646520 is 2564678921.
It is a super-2 number, since 2×129876465202 (a number of 21 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (50) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1876907 + ... + 1883813.
Almost surely, 212987646520 is an apocalyptic number.
12987646520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12987646520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15126447600).
12987646520 is an abundant number, since it is smaller than the sum of its proper divisors (17265248680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12987646520 is a wasteful number, since it uses less digits than its factorization.
12987646520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8568 (or 8564 counting only the distinct ones).
The product of its (nonzero) digits is 1451520, while the sum is 50.
The spelling of 12987646520 in words is "twelve billion, nine hundred eighty-seven million, six hundred forty-six thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •