Base | Representation |
---|---|
bin | 10111100111010001… |
… | …01110111111011101 |
3 | 1012201111220112010220 |
4 | 23303220232333131 |
5 | 201430413220232 |
6 | 5453550151553 |
7 | 626105525232 |
oct | 136350567735 |
9 | 35644815126 |
10 | 12677476317 |
11 | 5416117660 |
12 | 25597b25b9 |
13 | 1270618b9c |
14 | 8839b1789 |
15 | 4e2e9442c |
hex | 2f3a2efdd |
12677476317 has 16 divisors (see below), whose sum is σ = 19524670272. Its totient is φ = 7231358720.
The previous prime is 12677476313. The next prime is 12677476327. The reversal of 12677476317 is 71367477621.
It is a cyclic number.
It is not a de Polignac number, because 12677476317 - 22 = 12677476313 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a self number, because there is not a number n which added to its sum of digits gives 12677476317.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12677476313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11298438 + ... + 11299559.
It is an arithmetic number, because the mean of its divisors is an integer number (1220291892).
Almost surely, 212677476317 is an apocalyptic number.
12677476317 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
12677476317 is a deficient number, since it is larger than the sum of its proper divisors (6847193955).
12677476317 is a wasteful number, since it uses less digits than its factorization.
12677476317 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22598028.
The product of its digits is 2074464, while the sum is 51.
The spelling of 12677476317 in words is "twelve billion, six hundred seventy-seven million, four hundred seventy-six thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •