Base | Representation |
---|---|
bin | 110010110001… |
… | …100010110011 |
3 | 221001020001211 |
4 | 302301202303 |
5 | 11401411011 |
6 | 1153140551 |
7 | 221064022 |
oct | 62614263 |
9 | 27036054 |
10 | 13310131 |
11 | 757110a |
12 | 455a757 |
13 | 29b0423 |
14 | 1aa68b9 |
15 | 127db21 |
hex | cb18b3 |
13310131 has 2 divisors, whose sum is σ = 13310132. Its totient is φ = 13310130.
The previous prime is 13310113. The next prime is 13310147. The reversal of 13310131 is 13101331.
It is a happy number.
13310131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (13310113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is an emirp because it is prime and its reverse (13101331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13310131 - 29 = 13309619 is a prime.
It is a super-2 number, since 2×133101312 = 354319174474322, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13310831) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6655065 + 6655066.
It is an arithmetic number, because the mean of its divisors is an integer number (6655066).
Almost surely, 213310131 is an apocalyptic number.
13310131 is a deficient number, since it is larger than the sum of its proper divisors (1).
13310131 is an equidigital number, since it uses as much as digits as its factorization.
13310131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27, while the sum is 13.
The square root of 13310131 is about 3648.3052229768. The cubic root of 13310131 is about 236.9885933967.
Adding to 13310131 its reverse (13101331), we get a palindrome (26411462).
The spelling of 13310131 in words is "thirteen million, three hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •