Base | Representation |
---|---|
bin | 1101111100111… |
… | …10100111100010 |
3 | 22011020022221100 |
4 | 12332132213202 |
5 | 214430313014 |
6 | 15340335230 |
7 | 2620560153 |
oct | 676364742 |
9 | 264208840 |
10 | 117041634 |
11 | 60081126 |
12 | 33244516 |
13 | 1b32c508 |
14 | 1178992a |
15 | a41e009 |
hex | 6f9e9e2 |
117041634 has 96 divisors (see below), whose sum is σ = 290122560. Its totient is φ = 33868800.
The previous prime is 117041633. The next prime is 117041677. The reversal of 117041634 is 436140711.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 117041598 and 117041607.
It is not an unprimeable number, because it can be changed into a prime (117041633) 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 in 47 ways as a sum of consecutive naturals, for example, 238129 + ... + 238619.
It is an arithmetic number, because the mean of its divisors is an integer number (3022110).
Almost surely, 2117041634 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 117041634, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (145061280).
117041634 is an abundant number, since it is smaller than the sum of its proper divisors (173080926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117041634 is a wasteful number, since it uses less digits than its factorization.
117041634 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 576 (or 573 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 27.
The square root of 117041634 is about 10818.5781875439. The cubic root of 117041634 is about 489.1553322381.
The spelling of 117041634 in words is "one hundred seventeen million, forty-one thousand, six hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •