Base | Representation |
---|---|
bin | 110000101011… |
… | …011001011101 |
3 | 220000022100101 |
4 | 300223121131 |
5 | 11231320134 |
6 | 1133301101 |
7 | 213315055 |
oct | 60533135 |
9 | 26008311 |
10 | 12760669 |
11 | 7226309 |
12 | 4334791 |
13 | 284a2bc |
14 | 19a2565 |
15 | 11c0e14 |
hex | c2b65d |
12760669 has 4 divisors (see below), whose sum is σ = 12914496. Its totient is φ = 12606844.
The previous prime is 12760663. The next prime is 12760673. The reversal of 12760669 is 96606721.
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: 96606721 = 379 ⋅254899.
It is a cyclic number.
It is not a de Polignac number, because 12760669 - 23 = 12760661 is a prime.
It is a super-2 number, since 2×127606692 = 325669346655122, 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 (12760661) 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, 76789 + ... + 76954.
It is an arithmetic number, because the mean of its divisors is an integer number (3228624).
Almost surely, 212760669 is an apocalyptic number.
It is an amenable number.
12760669 is a deficient number, since it is larger than the sum of its proper divisors (153827).
12760669 is an equidigital number, since it uses as much as digits as its factorization.
12760669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153826.
The product of its (nonzero) digits is 27216, while the sum is 37.
The square root of 12760669 is about 3572.2078606934. The cubic root of 12760669 is about 233.6815804404.
The spelling of 12760669 in words is "twelve million, seven hundred sixty thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •