Base | Representation |
---|---|
bin | 110010001100… |
… | …001011100101 |
3 | 220202110010202 |
4 | 302030023211 |
5 | 11332011333 |
6 | 1150000245 |
7 | 216555605 |
oct | 62141345 |
9 | 26673122 |
10 | 13157093 |
11 | 7477134 |
12 | 44a6085 |
13 | 2958881 |
14 | 1a66c05 |
15 | 124d5e8 |
hex | c8c2e5 |
13157093 has 2 divisors, whose sum is σ = 13157094. Its totient is φ = 13157092.
The previous prime is 13157087. The next prime is 13157107. The reversal of 13157093 is 39075131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10745284 + 2411809 = 3278^2 + 1553^2 .
It is an emirp because it is prime and its reverse (39075131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13157093 - 28 = 13156837 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13157033) 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, 6578546 + 6578547.
It is an arithmetic number, because the mean of its divisors is an integer number (6578547).
Almost surely, 213157093 is an apocalyptic number.
It is an amenable number.
13157093 is a deficient number, since it is larger than the sum of its proper divisors (1).
13157093 is an equidigital number, since it uses as much as digits as its factorization.
13157093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2835, while the sum is 29.
The square root of 13157093 is about 3627.2707370694. The cubic root of 13157093 is about 236.0768027823.
The spelling of 13157093 in words is "thirteen million, one hundred fifty-seven thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •