Base | Representation |
---|---|
bin | 1011101001101011110001… |
… | …1101110110111111001000 |
3 | 1200100200210111120000112010 |
4 | 2322122330131312333020 |
5 | 3134342411112430210 |
6 | 43125102423015520 |
7 | 2461355302616466 |
oct | 272327435667710 |
9 | 50320714500463 |
10 | 12810754420680 |
11 | 409a012992a77 |
12 | 152a98789a5a0 |
13 | 71c08373b398 |
14 | 324088369836 |
15 | 173385442920 |
hex | ba6bc776fc8 |
12810754420680 has 256 divisors, whose sum is σ = 39565055024640. Its totient is φ = 3316884480000.
The previous prime is 12810754420679. The next prime is 12810754420721. The reversal of 12810754420680 is 8602445701821.
It is a happy number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1742719005 + ... + 1742726355.
It is an arithmetic number, because the mean of its divisors is an integer number (154550996190).
Almost surely, 212810754420680 is an apocalyptic number.
12810754420680 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 12810754420680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19782527512320).
12810754420680 is an abundant number, since it is smaller than the sum of its proper divisors (26754300603960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12810754420680 is a wasteful number, since it uses less digits than its factorization.
12810754420680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10232 (or 10228 counting only the distinct ones).
The product of its (nonzero) digits is 860160, while the sum is 48.
The spelling of 12810754420680 in words is "twelve trillion, eight hundred ten billion, seven hundred fifty-four million, four hundred twenty thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •