Base | Representation |
---|---|
bin | 110001101110… |
… | …011101000011 |
3 | 220112021010001 |
4 | 301232131003 |
5 | 11314112311 |
6 | 1143220431 |
7 | 215540611 |
oct | 61563503 |
9 | 26467101 |
10 | 13035331 |
11 | 73a3701 |
12 | 4447717 |
13 | 291531a |
14 | 1a346b1 |
15 | 12274c1 |
hex | c6e743 |
13035331 has 2 divisors, whose sum is σ = 13035332. Its totient is φ = 13035330.
The previous prime is 13035329. The next prime is 13035353. The reversal of 13035331 is 13353031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13035331 - 21 = 13035329 is a prime.
It is a super-2 number, since 2×130353312 = 339839708559122, which contains 22 as substring.
Together with 13035329, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 13035299 and 13035308.
It is not a weakly prime, because it can be changed into another prime (13035301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6517665 + 6517666.
It is an arithmetic number, because the mean of its divisors is an integer number (6517666).
Almost surely, 213035331 is an apocalyptic number.
13035331 is a deficient number, since it is larger than the sum of its proper divisors (1).
13035331 is an equidigital number, since it uses as much as digits as its factorization.
13035331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 405, while the sum is 19.
The square root of 13035331 is about 3610.4474791915. The cubic root of 13035331 is about 235.3462889252.
Adding to 13035331 its reverse (13353031), we get a palindrome (26388362).
It can be divided in two parts, 13035 and 331, that added together give a triangular number (13366 = T163).
The spelling of 13035331 in words is "thirteen million, thirty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •