Base | Representation |
---|---|
bin | 11001000110000000… |
… | …00001011000100101 |
3 | 1021202220011002210101 |
4 | 30203000001120211 |
5 | 210042330010432 |
6 | 10104454024101 |
7 | 654565021654 |
oct | 144300013045 |
9 | 37686132711 |
10 | 13472110117 |
11 | 5793722804 |
12 | 273b948031 |
13 | 13691403bb |
14 | 91b34119b |
15 | 53cb0b4e7 |
hex | 323001625 |
13472110117 has 2 divisors, whose sum is σ = 13472110118. Its totient is φ = 13472110116.
The previous prime is 13472110111. The next prime is 13472110133. The reversal of 13472110117 is 71101127431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8137122436 + 5334987681 = 90206^2 + 73041^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13472110117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13472110111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6736055058 + 6736055059.
It is an arithmetic number, because the mean of its divisors is an integer number (6736055059).
Almost surely, 213472110117 is an apocalyptic number.
It is an amenable number.
13472110117 is a deficient number, since it is larger than the sum of its proper divisors (1).
13472110117 is an equidigital number, since it uses as much as digits as its factorization.
13472110117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1176, while the sum is 28.
Adding to 13472110117 its reverse (71101127431), we get a palindrome (84573237548).
The spelling of 13472110117 in words is "thirteen billion, four hundred seventy-two million, one hundred ten thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •