Base | Representation |
---|---|
bin | 1101111111001… |
… | …11110000001101 |
3 | 22011210112212021 |
4 | 12333213300031 |
5 | 220014404242 |
6 | 15351010141 |
7 | 2623245421 |
oct | 677476015 |
9 | 264715767 |
10 | 117341197 |
11 | 602661a6 |
12 | 33369951 |
13 | 1b40597c |
14 | 11826b81 |
15 | a47cb67 |
hex | 6fe7c0d |
117341197 has 2 divisors, whose sum is σ = 117341198. Its totient is φ = 117341196.
The previous prime is 117341179. The next prime is 117341243. The reversal of 117341197 is 791143711.
It is a happy number.
Together with previous prime (117341179) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 66275881 + 51065316 = 8141^2 + 7146^2 .
It is an emirp because it is prime and its reverse (791143711) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 117341197 - 27 = 117341069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (117341117) 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, 58670598 + 58670599.
It is an arithmetic number, because the mean of its divisors is an integer number (58670599).
Almost surely, 2117341197 is an apocalyptic number.
It is an amenable number.
117341197 is a deficient number, since it is larger than the sum of its proper divisors (1).
117341197 is an equidigital number, since it uses as much as digits as its factorization.
117341197 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5292, while the sum is 34.
The square root of 117341197 is about 10832.4141815202. The cubic root of 117341197 is about 489.5723006747.
The spelling of 117341197 in words is "one hundred seventeen million, three hundred forty-one thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •