Base | Representation |
---|---|
bin | 110010110001… |
… | …100101100111 |
3 | 221001020022111 |
4 | 302301211213 |
5 | 11401412221 |
6 | 1153141451 |
7 | 221064400 |
oct | 62614547 |
9 | 27036274 |
10 | 13310311 |
11 | 7571263 |
12 | 455a887 |
13 | 29b0531 |
14 | 1aa69a7 |
15 | 127dbe1 |
hex | cb1967 |
13310311 has 6 divisors (see below), whose sum is σ = 15483480. Its totient is φ = 11408796.
The previous prime is 13310293. The next prime is 13310321. The reversal of 13310311 is 11301331.
It is a happy number.
13310311 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13310311 - 215 = 13277543 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13310291 and 13310300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13310321) 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 in 5 ways as a sum of consecutive naturals, for example, 135771 + ... + 135868.
It is an arithmetic number, because the mean of its divisors is an integer number (2580580).
Almost surely, 213310311 is an apocalyptic number.
13310311 is a deficient number, since it is larger than the sum of its proper divisors (2173169).
13310311 is an equidigital number, since it uses as much as digits as its factorization.
13310311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271653 (or 271646 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 13.
The square root of 13310311 is about 3648.3298918820. The cubic root of 13310311 is about 236.9896616996.
Adding to 13310311 its reverse (11301331), we get a palindrome (24611642).
The spelling of 13310311 in words is "thirteen million, three hundred ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •