Base | Representation |
---|---|
bin | 10111101010110000… |
… | …01011001010000111 |
3 | 1012210112212201022222 |
4 | 23311120023022013 |
5 | 202010403032141 |
6 | 5500512242555 |
7 | 626612036324 |
oct | 136530131207 |
9 | 35715781288 |
10 | 12706689671 |
11 | 5430660025 |
12 | 256754045b |
13 | 12766a6ab0 |
14 | 887817b4b |
15 | 4e581514b |
hex | 2f560b287 |
12706689671 has 8 divisors (see below), whose sum is σ = 13685866320. Its totient is φ = 11727761472.
The previous prime is 12706689649. The next prime is 12706689691. The reversal of 12706689671 is 17698660721.
12706689671 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12706689671 - 210 = 12706688647 is a prime.
It is a super-2 number, since 2×127066896712 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12706689631) 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 7 ways as a sum of consecutive naturals, for example, 51875 + ... + 167643.
It is an arithmetic number, because the mean of its divisors is an integer number (1710733290).
Almost surely, 212706689671 is an apocalyptic number.
12706689671 is a deficient number, since it is larger than the sum of its proper divisors (979176649).
12706689671 is a wasteful number, since it uses less digits than its factorization.
12706689671 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124225.
The product of its (nonzero) digits is 1524096, while the sum is 53.
The spelling of 12706689671 in words is "twelve billion, seven hundred six million, six hundred eighty-nine thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •