Base | Representation |
---|---|
bin | 110001110000… |
… | …111010011101 |
3 | 220112202221011 |
4 | 301300322131 |
5 | 11314423110 |
6 | 1143335221 |
7 | 215612152 |
oct | 61607235 |
9 | 26482834 |
10 | 13045405 |
11 | 740022a |
12 | 4451511 |
13 | 2919a99 |
14 | 1a38229 |
15 | 122a48a |
hex | c70e9d |
13045405 has 4 divisors (see below), whose sum is σ = 15654492. Its totient is φ = 10436320.
The previous prime is 13045391. The next prime is 13045427. The reversal of 13045405 is 50454031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 50454031 = 107 ⋅471533.
It can be written as a sum of positive squares in 2 ways, for example, as 4968441 + 8076964 = 2229^2 + 2842^2 .
It is not a de Polignac number, because 13045405 - 223 = 4656797 is a prime.
It is a super-2 number, since 2×130454052 = 340365183228050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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, 1304536 + ... + 1304545.
It is an arithmetic number, because the mean of its divisors is an integer number (3913623).
Almost surely, 213045405 is an apocalyptic number.
It is an amenable number.
13045405 is a deficient number, since it is larger than the sum of its proper divisors (2609087).
13045405 is an equidigital number, since it uses as much as digits as its factorization.
13045405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2609086.
The product of its (nonzero) digits is 1200, while the sum is 22.
The square root of 13045405 is about 3611.8423276771. The cubic root of 13045405 is about 235.4069003005.
Adding to 13045405 its reverse (50454031), we get a palindrome (63499436).
The spelling of 13045405 in words is "thirteen million, forty-five thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •