Base | Representation |
---|---|
bin | 111101011110… |
… | …000000101101 |
3 | 1010022122212001 |
4 | 331132000231 |
5 | 13111114314 |
6 | 1333212301 |
7 | 253651513 |
oct | 75360055 |
9 | 33278761 |
10 | 16113709 |
11 | 9106517 |
12 | 5491091 |
13 | 3452551 |
14 | 21d64b3 |
15 | 1634674 |
hex | f5e02d |
16113709 has 4 divisors (see below), whose sum is σ = 16317760. Its totient is φ = 15909660.
The previous prime is 16113677. The next prime is 16113719. The reversal of 16113709 is 90731161.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 90731161 = 43 ⋅2110027.
It is a cyclic number.
It is not a de Polignac number, because 16113709 - 25 = 16113677 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 (16113719) 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, 101907 + ... + 102064.
It is an arithmetic number, because the mean of its divisors is an integer number (4079440).
Almost surely, 216113709 is an apocalyptic number.
It is an amenable number.
16113709 is a deficient number, since it is larger than the sum of its proper divisors (204051).
16113709 is an equidigital number, since it uses as much as digits as its factorization.
16113709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204050.
The product of its (nonzero) digits is 1134, while the sum is 28.
The square root of 16113709 is about 4014.1884609470. The cubic root of 16113709 is about 252.5797362789.
The spelling of 16113709 in words is "sixteen million, one hundred thirteen thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •