Base | Representation |
---|---|
bin | 1011100011100001110100… |
… | …0000000010101001101000 |
3 | 1122222120211021121020210001 |
4 | 2320320131000002221220 |
5 | 3131124314422433223 |
6 | 43004332450432344 |
7 | 2450622511360342 |
oct | 270703500025150 |
9 | 48876737536701 |
10 | 12704999811688 |
11 | 40591841a1a78 |
12 | 15123928926b4 |
13 | 7120cb950782 |
14 | 31ccd4d36292 |
15 | 170745de39ad |
hex | b8e1d002a68 |
12704999811688 has 16 divisors (see below), whose sum is σ = 23981753002500. Its totient is φ = 6309865677696.
The previous prime is 12704999811629. The next prime is 12704999811689. The reversal of 12704999811688 is 88611899940721.
It can be written as a sum of positive squares in 2 ways, for example, as 8671481888644 + 4033517923044 = 2944738^2 + 2008362^2 .
It is a super-2 number, since 2×127049998116882 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12704999811688.
It is not an unprimeable number, because it can be changed into a prime (12704999811689) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5329277253 + ... + 5329279636.
Almost surely, 212704999811688 is an apocalyptic number.
It is an amenable number.
12704999811688 is a deficient number, since it is larger than the sum of its proper divisors (11276753190812).
12704999811688 is a wasteful number, since it uses less digits than its factorization.
12704999811688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10658557044 (or 10658557040 counting only the distinct ones).
The product of its (nonzero) digits is 125411328, while the sum is 73.
The spelling of 12704999811688 in words is "twelve trillion, seven hundred four billion, nine hundred ninety-nine million, eight hundred eleven thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •