Base | Representation |
---|---|
bin | 110001110000… |
… | …011001101111 |
3 | 220112200001121 |
4 | 301300121233 |
5 | 11314341221 |
6 | 1143321411 |
7 | 215603101 |
oct | 61603157 |
9 | 26480047 |
10 | 13043311 |
11 | 73a96a6 |
12 | 4450267 |
13 | 2918b48 |
14 | 1a37571 |
15 | 1229a41 |
hex | c7066f |
13043311 has 4 divisors (see below), whose sum is σ = 13131000. Its totient is φ = 12955624.
The previous prime is 13043309. The next prime is 13043333. The reversal of 13043311 is 11334031.
13043311 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11334031 = 1129 ⋅10039.
It is a cyclic number.
It is not a de Polignac number, because 13043311 - 21 = 13043309 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13043341) 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 3 ways as a sum of consecutive naturals, for example, 43621 + ... + 43918.
It is an arithmetic number, because the mean of its divisors is an integer number (3282750).
Almost surely, 213043311 is an apocalyptic number.
13043311 is a deficient number, since it is larger than the sum of its proper divisors (87689).
13043311 is an equidigital number, since it uses as much as digits as its factorization.
13043311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87688.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 13043311 is about 3611.5524362800. The cubic root of 13043311 is about 235.3943040792.
Adding to 13043311 its reverse (11334031), we get a palindrome (24377342).
The spelling of 13043311 in words is "thirteen million, forty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •