Base | Representation |
---|---|
bin | 11001010000001000… |
… | …01011101111011101 |
3 | 1021222211001101102122 |
4 | 30220010023233131 |
5 | 210231103242242 |
6 | 10121131232325 |
7 | 656646224363 |
oct | 145004135735 |
9 | 37884041378 |
10 | 13557087197 |
11 | 58276932a5 |
12 | 27642a86a5 |
13 | 1380923cb4 |
14 | 928741633 |
15 | 5452e4ad2 |
hex | 32810bbdd |
13557087197 has 2 divisors, whose sum is σ = 13557087198. Its totient is φ = 13557087196.
The previous prime is 13557087109. The next prime is 13557087209. The reversal of 13557087197 is 79178075531.
13557087197 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13434896281 + 122190916 = 115909^2 + 11054^2 .
It is a cyclic number.
It is not a de Polignac number, because 13557087197 - 222 = 13552892893 is a prime.
It is a super-2 number, since 2×135570871972 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13557087107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6778543598 + 6778543599.
It is an arithmetic number, because the mean of its divisors is an integer number (6778543599).
Almost surely, 213557087197 is an apocalyptic number.
It is an amenable number.
13557087197 is a deficient number, since it is larger than the sum of its proper divisors (1).
13557087197 is an equidigital number, since it uses as much as digits as its factorization.
13557087197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1852200, while the sum is 53.
The spelling of 13557087197 in words is "thirteen billion, five hundred fifty-seven million, eighty-seven thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •