Base | Representation |
---|---|
bin | 110010000000… |
… | …101010011111 |
3 | 220200001102120 |
4 | 302000222133 |
5 | 11324004134 |
6 | 1144554023 |
7 | 216301224 |
oct | 62005237 |
9 | 26601376 |
10 | 13109919 |
11 | 7444749 |
12 | 4482913 |
13 | 2940264 |
14 | 1a5394b |
15 | 123e649 |
hex | c80a9f |
13109919 has 4 divisors (see below), whose sum is σ = 17479896. Its totient is φ = 8739944.
The previous prime is 13109909. The next prime is 13109963. The reversal of 13109919 is 91990131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13109919 - 24 = 13109903 is a prime.
It is a super-2 number, since 2×131099192 = 343739952373122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13109919.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13109909) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2184984 + ... + 2184989.
It is an arithmetic number, because the mean of its divisors is an integer number (4369974).
Almost surely, 213109919 is an apocalyptic number.
13109919 is a deficient number, since it is larger than the sum of its proper divisors (4369977).
13109919 is an equidigital number, since it uses as much as digits as its factorization.
13109919 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4369976.
The product of its (nonzero) digits is 2187, while the sum is 33.
The square root of 13109919 is about 3620.7622125735. The cubic root of 13109919 is about 235.7943183041.
It can be divided in two parts, 13109 and 919, that added together give a triangular number (14028 = T167).
The spelling of 13109919 in words is "thirteen million, one hundred nine thousand, nine hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •