Base | Representation |
---|---|
bin | 110001011011… |
… | …110110001001 |
3 | 220101101120011 |
4 | 301123312021 |
5 | 11304142423 |
6 | 1141431521 |
7 | 215102446 |
oct | 61336611 |
9 | 26341504 |
10 | 12959113 |
11 | 7351412 |
12 | 440b5a1 |
13 | 28b971b |
14 | 1a149cd |
15 | 120eb0d |
hex | c5bd89 |
12959113 has 4 divisors (see below), whose sum is σ = 12971268. Its totient is φ = 12946960.
The previous prime is 12959099. The next prime is 12959123. The reversal of 12959113 is 31195921.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 9903609 + 3055504 = 3147^2 + 1748^2 .
It is a cyclic number.
It is not a de Polignac number, because 12959113 - 29 = 12958601 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12959123) 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, 4306 + ... + 6667.
It is an arithmetic number, because the mean of its divisors is an integer number (3242817).
Almost surely, 212959113 is an apocalyptic number.
It is an amenable number.
12959113 is a deficient number, since it is larger than the sum of its proper divisors (12155).
12959113 is a wasteful number, since it uses less digits than its factorization.
12959113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12154.
The product of its digits is 2430, while the sum is 31.
The square root of 12959113 is about 3599.8768034476. The cubic root of 12959113 is about 234.8866995707.
The spelling of 12959113 in words is "twelve million, nine hundred fifty-nine thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •