Base | Representation |
---|---|
bin | 110010101111… |
… | …110100001001 |
3 | 221000212100112 |
4 | 302233310021 |
5 | 11401144144 |
6 | 1153044105 |
7 | 221034254 |
oct | 62576411 |
9 | 27025315 |
10 | 13303049 |
11 | 7566861 |
12 | 4556635 |
13 | 29aa136 |
14 | 1aa409b |
15 | 127b99e |
hex | cafd09 |
13303049 has 2 divisors, whose sum is σ = 13303050. Its totient is φ = 13303048.
The previous prime is 13303033. The next prime is 13303067. The reversal of 13303049 is 94030331.
13303049 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6927424 + 6375625 = 2632^2 + 2525^2 .
It is an emirp because it is prime and its reverse (94030331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13303049 - 24 = 13303033 is a prime.
It is a super-2 number, since 2×133030492 = 353942225392802, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (13303649) 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, 6651524 + 6651525.
It is an arithmetic number, because the mean of its divisors is an integer number (6651525).
Almost surely, 213303049 is an apocalyptic number.
It is an amenable number.
13303049 is a deficient number, since it is larger than the sum of its proper divisors (1).
13303049 is an equidigital number, since it uses as much as digits as its factorization.
13303049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
The square root of 13303049 is about 3647.3345061839. The cubic root of 13303049 is about 236.9465539663.
The spelling of 13303049 in words is "thirteen million, three hundred three thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •