Base | Representation |
---|---|
bin | 1011100001010011100010… |
… | …1100010101100111100000 |
3 | 1122211221020202011201020200 |
4 | 2320110320230111213200 |
5 | 3130013111240443010 |
6 | 42535015124105200 |
7 | 2445101231661264 |
oct | 270247054254740 |
9 | 48757222151220 |
10 | 12666809702880 |
11 | 4043a66943a83 |
12 | 1506ab4b35200 |
13 | 70b623842458 |
14 | 31b110c980a4 |
15 | 16e75d26acc0 |
hex | b8538b159e0 |
12666809702880 has 432 divisors, whose sum is σ = 44400589741872. Its totient is φ = 3288054988800.
The previous prime is 12666809702867. The next prime is 12666809702933. The reversal of 12666809702880 is 8820790866621.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 519737095 + ... + 519761465.
It is an arithmetic number, because the mean of its divisors is an integer number (102779142921).
Almost surely, 212666809702880 is an apocalyptic number.
12666809702880 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 12666809702880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22200294870936).
12666809702880 is an abundant number, since it is smaller than the sum of its proper divisors (31733780038992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12666809702880 is a wasteful number, since it uses less digits than its factorization.
12666809702880 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24611 (or 24539 counting only the distinct ones).
The product of its (nonzero) digits is 27869184, while the sum is 63.
The spelling of 12666809702880 in words is "twelve trillion, six hundred sixty-six billion, eight hundred nine million, seven hundred two thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •