Base | Representation |
---|---|
bin | 101110000010… |
… | …100001011101 |
3 | 211201011111102 |
4 | 232002201131 |
5 | 11042201312 |
6 | 1110402445 |
7 | 204404315 |
oct | 56024135 |
9 | 24634442 |
10 | 12068957 |
11 | 68a364a |
12 | 4060425 |
13 | 26674c4 |
14 | 1862445 |
15 | 10d5ec2 |
hex | b8285d |
12068957 has 2 divisors, whose sum is σ = 12068958. Its totient is φ = 12068956.
The previous prime is 12068941. The next prime is 12069011. The reversal of 12068957 is 75986021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9821956 + 2247001 = 3134^2 + 1499^2 .
It is an emirp because it is prime and its reverse (75986021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12068957 - 24 = 12068941 is a prime.
It is a super-3 number, since 3×120689573 (a number of 22 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12068957.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12068257) 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 as a sum of consecutive naturals, namely, 6034478 + 6034479.
It is an arithmetic number, because the mean of its divisors is an integer number (6034479).
Almost surely, 212068957 is an apocalyptic number.
It is an amenable number.
12068957 is a deficient number, since it is larger than the sum of its proper divisors (1).
12068957 is an equidigital number, since it uses as much as digits as its factorization.
12068957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30240, while the sum is 38.
The square root of 12068957 is about 3474.0404430576. The cubic root of 12068957 is about 229.3805448498.
The spelling of 12068957 in words is "twelve million, sixty-eight thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •