Base | Representation |
---|---|
bin | 110010100101… |
… | …011110100101 |
3 | 220221201021101 |
4 | 302211132211 |
5 | 11343320314 |
6 | 1152120101 |
7 | 220466650 |
oct | 62453645 |
9 | 26851241 |
10 | 13260709 |
11 | 7537a70 |
12 | 4536031 |
13 | 2993a97 |
14 | 1a92897 |
15 | 126e174 |
hex | ca57a5 |
13260709 has 8 divisors (see below), whose sum is σ = 16532928. Its totient is φ = 10332960.
The previous prime is 13260701. The next prime is 13260713. The reversal of 13260709 is 90706231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13260709 - 23 = 13260701 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 (13260701) 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 7 ways as a sum of consecutive naturals, for example, 86032 + ... + 86185.
It is an arithmetic number, because the mean of its divisors is an integer number (2066616).
Almost surely, 213260709 is an apocalyptic number.
It is an amenable number.
13260709 is a deficient number, since it is larger than the sum of its proper divisors (3272219).
13260709 is a wasteful number, since it uses less digits than its factorization.
13260709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172235.
The product of its (nonzero) digits is 2268, while the sum is 28.
The square root of 13260709 is about 3641.5256418155. The cubic root of 13260709 is about 236.6949079129.
The spelling of 13260709 in words is "thirteen million, two hundred sixty thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •