Base | Representation |
---|---|
bin | 110001011101… |
… | …110001010101 |
3 | 220101210101011 |
4 | 301131301111 |
5 | 11304420442 |
6 | 1141532221 |
7 | 215134441 |
oct | 61356125 |
9 | 26353334 |
10 | 12966997 |
11 | 735732a |
12 | 4414071 |
13 | 28c01a4 |
14 | 1a17821 |
15 | 1212117 |
hex | c5dc55 |
12966997 has 2 divisors, whose sum is σ = 12966998. Its totient is φ = 12966996.
The previous prime is 12966991. The next prime is 12967001. The reversal of 12966997 is 79966921.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10536516 + 2430481 = 3246^2 + 1559^2 .
It is an emirp because it is prime and its reverse (79966921) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12966997 is a prime.
It is a super-2 number, since 2×129669972 = 336286022396018, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12966997.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12966991) 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 as a sum of consecutive naturals, namely, 6483498 + 6483499.
It is an arithmetic number, because the mean of its divisors is an integer number (6483499).
Almost surely, 212966997 is an apocalyptic number.
It is an amenable number.
12966997 is a deficient number, since it is larger than the sum of its proper divisors (1).
12966997 is an equidigital number, since it uses as much as digits as its factorization.
12966997 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 367416, while the sum is 49.
The square root of 12966997 is about 3600.9716744234. The cubic root of 12966997 is about 234.9343229774.
The spelling of 12966997 in words is "twelve million, nine hundred sixty-six thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •