Base | Representation |
---|---|
bin | 1110000010011… |
… | …01010111010101 |
3 | 22012120200210002 |
4 | 13001031113111 |
5 | 220121214042 |
6 | 15403541045 |
7 | 2626631012 |
oct | 701152725 |
9 | 265520702 |
10 | 117757397 |
11 | 6051a96a |
12 | 3352a785 |
13 | 1b520244 |
14 | 118d4709 |
15 | a511132 |
hex | 704d5d5 |
117757397 has 2 divisors, whose sum is σ = 117757398. Its totient is φ = 117757396.
The previous prime is 117757373. The next prime is 117757399. The reversal of 117757397 is 793757711.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107350321 + 10407076 = 10361^2 + 3226^2 .
It is an emirp because it is prime and its reverse (793757711) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 117757397 - 224 = 100980181 is a prime.
It is a super-3 number, since 3×1177573973 (a number of 25 digits) contains 333 as substring.
Together with 117757399, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (117757399) by changing a digit.
It is a good prime.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58878698 + 58878699.
It is an arithmetic number, because the mean of its divisors is an integer number (58878699).
Almost surely, 2117757397 is an apocalyptic number.
It is an amenable number.
117757397 is a deficient number, since it is larger than the sum of its proper divisors (1).
117757397 is an equidigital number, since it uses as much as digits as its factorization.
117757397 is an evil number, because the sum of its binary digits is even.
The product of its digits is 324135, while the sum is 47.
The square root of 117757397 is about 10851.6080375214. The cubic root of 117757397 is about 490.1504424909.
The spelling of 117757397 in words is "one hundred seventeen million, seven hundred fifty-seven thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •