Base | Representation |
---|---|
bin | 110000010101… |
… | …011100110001 |
3 | 212211202000202 |
4 | 300111130301 |
5 | 11220431034 |
6 | 1131324545 |
7 | 212462006 |
oct | 60253461 |
9 | 25752022 |
10 | 12670769 |
11 | 7174811 |
12 | 42b0755 |
13 | 28183c7 |
14 | 197b8ad |
15 | 11a447e |
hex | c15731 |
12670769 has 4 divisors (see below), whose sum is σ = 13221696. Its totient is φ = 12119844.
The previous prime is 12670741. The next prime is 12670771. The reversal of 12670769 is 96707621.
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: 96707621 = 2411 ⋅40111.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12670769 is a prime.
It is a super-2 number, since 2×126707692 = 321096774102722, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12670069) 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, 275429 + ... + 275474.
It is an arithmetic number, because the mean of its divisors is an integer number (3305424).
Almost surely, 212670769 is an apocalyptic number.
It is an amenable number.
12670769 is a deficient number, since it is larger than the sum of its proper divisors (550927).
12670769 is an equidigital number, since it uses as much as digits as its factorization.
12670769 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 550926.
The product of its (nonzero) digits is 31752, while the sum is 38.
The square root of 12670769 is about 3559.6023654335. The cubic root of 12670769 is about 233.1315177855.
The spelling of 12670769 in words is "twelve million, six hundred seventy thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •