Base | Representation |
---|---|
bin | 101101101001… |
… | …110111111101 |
3 | 211112001000011 |
4 | 231221313331 |
5 | 11030433442 |
6 | 1104303221 |
7 | 203504056 |
oct | 55516775 |
9 | 24461004 |
10 | 11967997 |
11 | 6834808 |
12 | 4011b11 |
13 | 2630572 |
14 | 183772d |
15 | 10b6117 |
hex | b69dfd |
11967997 has 2 divisors, whose sum is σ = 11967998. Its totient is φ = 11967996.
The previous prime is 11967979. The next prime is 11968001. The reversal of 11967997 is 79976911.
It is a happy number.
Together with previous prime (11967979) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10929636 + 1038361 = 3306^2 + 1019^2 .
It is a cyclic number.
It is not a de Polignac number, because 11967997 - 211 = 11965949 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11967997.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11967937) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5983998 + 5983999.
It is an arithmetic number, because the mean of its divisors is an integer number (5983999).
Almost surely, 211967997 is an apocalyptic number.
It is an amenable number.
11967997 is a deficient number, since it is larger than the sum of its proper divisors (1).
11967997 is an equidigital number, since it uses as much as digits as its factorization.
11967997 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 214326, while the sum is 49.
The square root of 11967997 is about 3459.4792960791. The cubic root of 11967997 is about 228.7391434823.
The spelling of 11967997 in words is "eleven million, nine hundred sixty-seven thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •