Base | Representation |
---|---|
bin | 1110000000011… |
… | …00000111010011 |
3 | 22012002010011100 |
4 | 13000030013103 |
5 | 220034141011 |
6 | 15354115443 |
7 | 2624435553 |
oct | 700140723 |
9 | 265063140 |
10 | 117490131 |
11 | 60358090 |
12 | 3341bb83 |
13 | 1b4586b5 |
14 | 11865163 |
15 | a4abd56 |
hex | 700c1d3 |
117490131 has 12 divisors (see below), whose sum is σ = 185136120. Its totient is φ = 71206080.
The previous prime is 117490117. The next prime is 117490157. The reversal of 117490131 is 131094711.
It is not a de Polignac number, because 117490131 - 25 = 117490099 is a prime.
It is a super-2 number, since 2×1174901312 = 27607861764794322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 117490095 and 117490104.
It is not an unprimeable number, because it can be changed into a prime (117490171) 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 in 11 ways as a sum of consecutive naturals, for example, 593286 + ... + 593483.
It is an arithmetic number, because the mean of its divisors is an integer number (15428010).
Almost surely, 2117490131 is an apocalyptic number.
117490131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
117490131 is a deficient number, since it is larger than the sum of its proper divisors (67645989).
117490131 is a wasteful number, since it uses less digits than its factorization.
117490131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1186786 (or 1186783 counting only the distinct ones).
The product of its (nonzero) digits is 756, while the sum is 27.
The square root of 117490131 is about 10839.2864617557. The cubic root of 117490131 is about 489.7793411578.
The spelling of 117490131 in words is "one hundred seventeen million, four hundred ninety thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •