Base | Representation |
---|---|
bin | 1100000000011011011010… |
… | …1111111001100000110001 |
3 | 1201202001101021021000212212 |
4 | 3000012312233321200301 |
5 | 3212243133112312012 |
6 | 44024404031501505 |
7 | 2531530326600023 |
oct | 300066657714061 |
9 | 51661337230785 |
10 | 13201500510257 |
11 | 422a7a796a514 |
12 | 1592657987895 |
13 | 749b85b17b87 |
14 | 338d55500013 |
15 | 17d604706b22 |
hex | c01b6bf9831 |
13201500510257 has 2 divisors, whose sum is σ = 13201500510258. Its totient is φ = 13201500510256.
The previous prime is 13201500510229. The next prime is 13201500510259. The reversal of 13201500510257 is 75201500510231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12254088341056 + 947412169201 = 3500584^2 + 973351^2 .
It is a cyclic number.
It is not a de Polignac number, because 13201500510257 - 28 = 13201500510001 is a prime.
Together with 13201500510259, 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 (13201500510259) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6600750255128 + 6600750255129.
It is an arithmetic number, because the mean of its divisors is an integer number (6600750255129).
Almost surely, 213201500510257 is an apocalyptic number.
It is an amenable number.
13201500510257 is a deficient number, since it is larger than the sum of its proper divisors (1).
13201500510257 is an equidigital number, since it uses as much as digits as its factorization.
13201500510257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10500, while the sum is 32.
The spelling of 13201500510257 in words is "thirteen trillion, two hundred one billion, five hundred million, five hundred ten thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •