Base | Representation |
---|---|
bin | 110011100000… |
… | …000100100101 |
3 | 221101220111021 |
4 | 303200010211 |
5 | 11424010314 |
6 | 1201211141 |
7 | 222516445 |
oct | 63400445 |
9 | 27356437 |
10 | 13500709 |
11 | 7691312 |
12 | 4630ab1 |
13 | 2a490b1 |
14 | 1b16125 |
15 | 12ba324 |
hex | ce0125 |
13500709 has 4 divisors (see below), whose sum is σ = 13511916. Its totient is φ = 13489504.
The previous prime is 13500691. The next prime is 13500733. The reversal of 13500709 is 90700531.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 90700531 = 5297 ⋅17123.
It can be written as a sum of positive squares in 2 ways, for example, as 11088900 + 2411809 = 3330^2 + 1553^2 .
It is a cyclic number.
It is not a de Polignac number, because 13500709 - 223 = 5112101 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 (13500749) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3544 + ... + 6289.
It is an arithmetic number, because the mean of its divisors is an integer number (3377979).
Almost surely, 213500709 is an apocalyptic number.
It is an amenable number.
13500709 is a deficient number, since it is larger than the sum of its proper divisors (11207).
13500709 is an equidigital number, since it uses as much as digits as its factorization.
13500709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11206.
The product of its (nonzero) digits is 945, while the sum is 25.
The square root of 13500709 is about 3674.3310955873. The cubic root of 13500709 is about 238.1143261198.
The spelling of 13500709 in words is "thirteen million, five hundred thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •