Base | Representation |
---|---|
bin | 110001000101… |
… | …000111110001 |
3 | 220012122212202 |
4 | 301011013301 |
5 | 11243203113 |
6 | 1135432545 |
7 | 214234205 |
oct | 61050761 |
9 | 26178782 |
10 | 12866033 |
11 | 7298494 |
12 | 4385755 |
13 | 288624b |
14 | 19ccb05 |
15 | 11e2258 |
hex | c451f1 |
12866033 has 4 divisors (see below), whose sum is σ = 12984180. Its totient is φ = 12747888.
The previous prime is 12866011. The next prime is 12866041. The reversal of 12866033 is 33066821.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 33066821 = 19 ⋅1740359.
It can be written as a sum of positive squares in 2 ways, for example, as 7139584 + 5726449 = 2672^2 + 2393^2 .
It is a cyclic number.
It is not a de Polignac number, because 12866033 - 26 = 12865969 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12865987 and 12866005.
It is not an unprimeable number, because it can be changed into a prime (12866083) 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, 58910 + ... + 59127.
It is an arithmetic number, because the mean of its divisors is an integer number (3246045).
Almost surely, 212866033 is an apocalyptic number.
It is an amenable number.
12866033 is a deficient number, since it is larger than the sum of its proper divisors (118147).
12866033 is a wasteful number, since it uses less digits than its factorization.
12866033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118146.
The product of its (nonzero) digits is 5184, while the sum is 29.
The square root of 12866033 is about 3586.9252849760. The cubic root of 12866033 is about 234.3229827791.
The spelling of 12866033 in words is "twelve million, eight hundred sixty-six thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •