Base | Representation |
---|---|
bin | 110000101111… |
… | …000011110101 |
3 | 220001001220221 |
4 | 300233003311 |
5 | 11232310134 |
6 | 1133454341 |
7 | 213406564 |
oct | 60570365 |
9 | 26031827 |
10 | 12775669 |
11 | 7236605 |
12 | 43413b1 |
13 | 285408a |
14 | 19a7bdb |
15 | 11c55b4 |
hex | c2f0f5 |
12775669 has 4 divisors (see below), whose sum is σ = 12955680. Its totient is φ = 12595660.
The previous prime is 12775663. The next prime is 12775691. The reversal of 12775669 is 96657721.
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: 96657721 = 31 ⋅3117991.
It is a cyclic number.
It is not a de Polignac number, because 12775669 - 213 = 12767477 is a prime.
It is a super-2 number, since 2×127756692 = 326435436795122, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12775663) 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, 89899 + ... + 90040.
It is an arithmetic number, because the mean of its divisors is an integer number (3238920).
Almost surely, 212775669 is an apocalyptic number.
It is an amenable number.
12775669 is a deficient number, since it is larger than the sum of its proper divisors (180011).
12775669 is an equidigital number, since it uses as much as digits as its factorization.
12775669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180010.
The product of its digits is 158760, while the sum is 43.
The square root of 12775669 is about 3574.3067859377. The cubic root of 12775669 is about 233.7731078035.
The spelling of 12775669 in words is "twelve million, seven hundred seventy-five thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •