Base | Representation |
---|---|
bin | 110001011000… |
… | …110010101001 |
3 | 220100202101202 |
4 | 301120302221 |
5 | 11303242401 |
6 | 1141253545 |
7 | 215021123 |
oct | 61306251 |
9 | 26322352 |
10 | 12946601 |
11 | 7342a78 |
12 | 44042b5 |
13 | 28b3b15 |
14 | 1a10213 |
15 | 120b06b |
hex | c58ca9 |
12946601 has 4 divisors (see below), whose sum is σ = 13026192. Its totient is φ = 12867012.
The previous prime is 12946519. The next prime is 12946603. The reversal of 12946601 is 10664921.
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: 10664921 = 79 ⋅134999.
It is a cyclic number.
It is not a de Polignac number, because 12946601 - 210 = 12945577 is a prime.
It is a super-2 number, since 2×129466012 = 335228954906402, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12946603) 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, 39551 + ... + 39876.
It is an arithmetic number, because the mean of its divisors is an integer number (3256548).
Almost surely, 212946601 is an apocalyptic number.
It is an amenable number.
12946601 is a deficient number, since it is larger than the sum of its proper divisors (79591).
12946601 is an equidigital number, since it uses as much as digits as its factorization.
12946601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79590.
The product of its (nonzero) digits is 2592, while the sum is 29.
The square root of 12946601 is about 3598.1385465265. The cubic root of 12946601 is about 234.8110810021.
The spelling of 12946601 in words is "twelve million, nine hundred forty-six thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •