Base | Representation |
---|---|
bin | 1101111110001… |
… | …11110010010001 |
3 | 22011112220020122 |
4 | 12333013302101 |
5 | 220001212012 |
6 | 15344120025 |
7 | 2622161603 |
oct | 677076221 |
9 | 264486218 |
10 | 117210257 |
11 | 6018688a |
12 | 33306015 |
13 | 1b38b1a8 |
14 | 117d1173 |
15 | a453e72 |
hex | 6fc7c91 |
117210257 has 8 divisors (see below), whose sum is σ = 128385000. Its totient is φ = 106511104.
The previous prime is 117210253. The next prime is 117210283. The reversal of 117210257 is 752012711.
It can be written as a sum of positive squares in 4 ways, for example, as 36192256 + 81018001 = 6016^2 + 9001^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 117210257 - 22 = 117210253 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (117210253) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 118382 + ... + 119367.
It is an arithmetic number, because the mean of its divisors is an integer number (16048125).
Almost surely, 2117210257 is an apocalyptic number.
117210257 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
117210257 is a deficient number, since it is larger than the sum of its proper divisors (11174743).
117210257 is a wasteful number, since it uses less digits than its factorization.
117210257 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 237795.
The product of its (nonzero) digits is 980, while the sum is 26.
The square root of 117210257 is about 10826.3685970874. The cubic root of 117210257 is about 489.3901297689.
Adding to 117210257 its reverse (752012711), we get a palindrome (869222968).
The spelling of 117210257 in words is "one hundred seventeen million, two hundred ten thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •