Base | Representation |
---|---|
bin | 110001101111… |
… | …110101111011 |
3 | 220112112220201 |
4 | 301233311323 |
5 | 11314303034 |
6 | 1143303031 |
7 | 215563315 |
oct | 61576573 |
9 | 26475821 |
10 | 13041019 |
11 | 73a7a02 |
12 | 444aa77 |
13 | 2917aa4 |
14 | 1a367b5 |
15 | 1229014 |
hex | c6fd7b |
13041019 has 4 divisors (see below), whose sum is σ = 13170240. Its totient is φ = 12911800.
The previous prime is 13041013. The next prime is 13041029. The reversal of 13041019 is 91014031.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 91014031 = 2297 ⋅39623.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13041019 is a prime.
It is a super-2 number, since 2×130410192 = 340136353116722, which contains 22 as substring.
It is a Duffinian number.
It is a zygodrome in base 12.
It is a junction number, because it is equal to n+sod(n) for n = 13040987 and 13041005.
It is not an unprimeable number, because it can be changed into a prime (13041013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 64459 + ... + 64660.
It is an arithmetic number, because the mean of its divisors is an integer number (3292560).
Almost surely, 213041019 is an apocalyptic number.
13041019 is a deficient number, since it is larger than the sum of its proper divisors (129221).
13041019 is a wasteful number, since it uses less digits than its factorization.
13041019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129220.
The product of its (nonzero) digits is 108, while the sum is 19.
The square root of 13041019 is about 3611.2351072729. The cubic root of 13041019 is about 235.3805152657.
The spelling of 13041019 in words is "thirteen million, forty-one thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •