Base | Representation |
---|---|
bin | 1111001100101010100100… |
… | …1001110110001011001001 |
3 | 2012011111002210121101101222 |
4 | 3303022221021312023021 |
5 | 4142240103220242022 |
6 | 55312330544051425 |
7 | 3343163560322606 |
oct | 363125111661311 |
9 | 65144083541358 |
10 | 16710260712137 |
11 | 5362866599a53 |
12 | 1a5a688603b75 |
13 | 942a03665b45 |
14 | 41aad0c4d6ad |
15 | 1dea13b8e242 |
hex | f32a92762c9 |
16710260712137 has 2 divisors, whose sum is σ = 16710260712138. Its totient is φ = 16710260712136.
The previous prime is 16710260712133. The next prime is 16710260712161. The reversal of 16710260712137 is 73121706201761.
16710260712137 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13059470936521 + 3650789775616 = 3613789^2 + 1910704^2 .
It is a cyclic number.
It is not a de Polignac number, because 16710260712137 - 22 = 16710260712133 is a prime.
It is not a weakly prime, because it can be changed into another prime (16710260712133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8355130356068 + 8355130356069.
It is an arithmetic number, because the mean of its divisors is an integer number (8355130356069).
Almost surely, 216710260712137 is an apocalyptic number.
It is an amenable number.
16710260712137 is a deficient number, since it is larger than the sum of its proper divisors (1).
16710260712137 is an equidigital number, since it uses as much as digits as its factorization.
16710260712137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 148176, while the sum is 44.
Adding to 16710260712137 its reverse (73121706201761), we get a palindrome (89831966913898).
The spelling of 16710260712137 in words is "sixteen trillion, seven hundred ten billion, two hundred sixty million, seven hundred twelve thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.397 sec. • engine limits •