Base | Representation |
---|---|
bin | 110000011110… |
… | …100011100011 |
3 | 212220122012011 |
4 | 300132203203 |
5 | 11223124232 |
6 | 1132213351 |
7 | 213005521 |
oct | 60364343 |
9 | 25818164 |
10 | 12708067 |
11 | 719a839 |
12 | 430a257 |
13 | 282c388 |
14 | 198b311 |
15 | 11b0547 |
hex | c1e8e3 |
12708067 has 4 divisors (see below), whose sum is σ = 12839176. Its totient is φ = 12576960.
The previous prime is 12708041. The next prime is 12708071. The reversal of 12708067 is 76080721.
It is a happy number.
12708067 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 76080721 = 811 ⋅93811.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12708067 is a prime.
It is a super-2 number, since 2×127080672 = 322989933752978, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12708767) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 65409 + ... + 65602.
It is an arithmetic number, because the mean of its divisors is an integer number (3209794).
Almost surely, 212708067 is an apocalyptic number.
12708067 is a deficient number, since it is larger than the sum of its proper divisors (131109).
12708067 is an equidigital number, since it uses as much as digits as its factorization.
12708067 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131108.
The product of its (nonzero) digits is 4704, while the sum is 31.
The square root of 12708067 is about 3564.8375839581. The cubic root of 12708067 is about 233.3600443344.
Adding to 12708067 its reverse (76080721), we get a palindrome (88788788).
The spelling of 12708067 in words is "twelve million, seven hundred eight thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •