Base | Representation |
---|---|
bin | 1110000010101… |
… | …10110110010001 |
3 | 22012122200001202 |
4 | 13001112312101 |
5 | 220123434431 |
6 | 15404440545 |
7 | 2630152163 |
oct | 701266621 |
9 | 265580052 |
10 | 117796241 |
11 | 60547072 |
12 | 33549155 |
13 | 1b534b24 |
14 | 11904933 |
15 | a51c8cb |
hex | 7056d91 |
117796241 has 8 divisors (see below), whose sum is σ = 120529920. Its totient is φ = 115072128.
The previous prime is 117796229. The next prime is 117796253. The reversal of 117796241 is 142697711.
It is an interprime number because it is at equal distance from previous prime (117796229) and next prime (117796253).
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 117796241 - 26 = 117796177 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 117796195 and 117796204.
It is not an unprimeable number, because it can be changed into a prime (117796201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26465 + ... + 30593.
It is an arithmetic number, because the mean of its divisors is an integer number (15066240).
Almost surely, 2117796241 is an apocalyptic number.
It is an amenable number.
117796241 is a deficient number, since it is larger than the sum of its proper divisors (2733679).
117796241 is an equidigital number, since it uses as much as digits as its factorization.
117796241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4783.
The product of its digits is 21168, while the sum is 38.
The square root of 117796241 is about 10853.3976707757. The cubic root of 117796241 is about 490.2043309972.
The spelling of 117796241 in words is "one hundred seventeen million, seven hundred ninety-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •