Base | Representation |
---|---|
bin | 1011100011101110111011… |
… | …1010001000001000000000 |
3 | 1122222220220201020100212010 |
4 | 2320323232322020020000 |
5 | 3131204022444222413 |
6 | 43010114132132520 |
7 | 2451106003132116 |
oct | 270735672101000 |
9 | 48886821210763 |
10 | 12708521476608 |
11 | 405a721076a51 |
12 | 1512bb6167140 |
13 | 712540434279 |
14 | 31d14a933ab6 |
15 | 1708a017edc3 |
hex | b8eeee88200 |
12708521476608 has 160 divisors (see below), whose sum is σ = 34832340962496. Its totient is φ = 4115781255168.
The previous prime is 12708521476591. The next prime is 12708521476633. The reversal of 12708521476608 is 80667412580721.
It is a hoax number, since the sum of its digits (57) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 6666760 + ... + 8358392.
Almost surely, 212708521476608 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12708521476608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17416170481248).
12708521476608 is an abundant number, since it is smaller than the sum of its proper divisors (22123819485888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12708521476608 is an equidigital number, since it uses as much as digits as its factorization.
12708521476608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1691794 (or 1691778 counting only the distinct ones).
The product of its (nonzero) digits is 9031680, while the sum is 57.
The spelling of 12708521476608 in words is "twelve trillion, seven hundred eight billion, five hundred twenty-one million, four hundred seventy-six thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •