Base | Representation |
---|---|
bin | 10111101011111000… |
… | …01000111010001110 |
3 | 1012211012121201002020 |
4 | 23311330020322032 |
5 | 202020311231041 |
6 | 5501450311010 |
7 | 630055134201 |
oct | 136574107216 |
9 | 35735551066 |
10 | 12716117646 |
11 | 5435a0a441 |
12 | 256a728466 |
13 | 127862818b |
14 | 888b8d938 |
15 | 4e6578866 |
hex | 2f5f08e8e |
12716117646 has 8 divisors (see below), whose sum is σ = 25432235304. Its totient is φ = 4238705880.
The previous prime is 12716117611. The next prime is 12716117653. The reversal of 12716117646 is 64671161721.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
12716117646 is an admirable number.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12716117598 and 12716117607.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 1059676465 + ... + 1059676476.
It is an arithmetic number, because the mean of its divisors is an integer number (3179029413).
Almost surely, 212716117646 is an apocalyptic number.
12716117646 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12716117646 is a wasteful number, since it uses less digits than its factorization.
12716117646 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2119352946.
The product of its digits is 84672, while the sum is 42.
The spelling of 12716117646 in words is "twelve billion, seven hundred sixteen million, one hundred seventeen thousand, six hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •