Base | Representation |
---|---|
bin | 110001110100… |
… | …110110001001 |
3 | 220120121000202 |
4 | 301310312021 |
5 | 11320432023 |
6 | 1143541545 |
7 | 216010133 |
oct | 61646611 |
9 | 26517022 |
10 | 13061513 |
11 | 7411343 |
12 | 445a8b5 |
13 | 292420a |
14 | 1a40053 |
15 | 1230128 |
hex | c74d89 |
13061513 has 8 divisors (see below), whose sum is σ = 13555080. Its totient is φ = 12570880.
The previous prime is 13061471. The next prime is 13061527. The reversal of 13061513 is 31516031.
It is a happy number.
13061513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 3892729 + 9168784 = 1973^2 + 3028^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13061513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13069513) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12881 + ... + 13857.
It is an arithmetic number, because the mean of its divisors is an integer number (1694385).
Almost surely, 213061513 is an apocalyptic number.
It is an amenable number.
13061513 is a deficient number, since it is larger than the sum of its proper divisors (493567).
13061513 is an equidigital number, since it uses as much as digits as its factorization.
13061513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1467.
The product of its (nonzero) digits is 270, while the sum is 20.
The square root of 13061513 is about 3614.0715266857. The cubic root of 13061513 is about 235.5037511254.
Adding to 13061513 its reverse (31516031), we get a palindrome (44577544).
The spelling of 13061513 in words is "thirteen million, sixty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •