Base | Representation |
---|---|
bin | 110010010100… |
… | …011010011101 |
3 | 220211011101122 |
4 | 302110122131 |
5 | 11334101223 |
6 | 1150420325 |
7 | 220056116 |
oct | 62243235 |
9 | 26734348 |
10 | 13190813 |
11 | 749a4a9 |
12 | 45016a5 |
13 | 296b01c |
14 | 1a7520d |
15 | 12585c8 |
hex | c9469d |
13190813 has 2 divisors, whose sum is σ = 13190814. Its totient is φ = 13190812.
The previous prime is 13190791. The next prime is 13190831. The reversal of 13190813 is 31809131.
13190813 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (13190831) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12020089 + 1170724 = 3467^2 + 1082^2 .
It is a cyclic number.
It is not a de Polignac number, because 13190813 - 28 = 13190557 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 (13190873) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6595406 + 6595407.
It is an arithmetic number, because the mean of its divisors is an integer number (6595407).
Almost surely, 213190813 is an apocalyptic number.
It is an amenable number.
13190813 is a deficient number, since it is larger than the sum of its proper divisors (1).
13190813 is an equidigital number, since it uses as much as digits as its factorization.
13190813 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 26.
The square root of 13190813 is about 3631.9158855899. The cubic root of 13190813 is about 236.2783092715.
Adding to 13190813 its reverse (31809131), we get a palindrome (44999944).
The spelling of 13190813 in words is "thirteen million, one hundred ninety thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.019 sec. • engine limits •