Base | Representation |
---|---|
bin | 11000100110001010… |
… | …10100100111001001 |
3 | 1021002021122202120112 |
4 | 30103011110213021 |
5 | 204020444023022 |
6 | 10022154204105 |
7 | 645143123156 |
oct | 142305244711 |
9 | 37067582515 |
10 | 13205064137 |
11 | 5666a07151 |
12 | 2686423635 |
13 | 1325a10025 |
14 | 8d3aa922d |
15 | 52445b8e2 |
hex | 3131549c9 |
13205064137 has 2 divisors, whose sum is σ = 13205064138. Its totient is φ = 13205064136.
The previous prime is 13205064133. The next prime is 13205064139. The reversal of 13205064137 is 73146050231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13150584976 + 54479161 = 114676^2 + 7381^2 .
It is a cyclic number.
It is not a de Polignac number, because 13205064137 - 22 = 13205064133 is a prime.
Together with 13205064139, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (13205064133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6602532068 + 6602532069.
It is an arithmetic number, because the mean of its divisors is an integer number (6602532069).
Almost surely, 213205064137 is an apocalyptic number.
It is an amenable number.
13205064137 is a deficient number, since it is larger than the sum of its proper divisors (1).
13205064137 is an equidigital number, since it uses as much as digits as its factorization.
13205064137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15120, while the sum is 32.
The spelling of 13205064137 in words is "thirteen billion, two hundred five million, sixty-four thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •