Base | Representation |
---|---|
bin | 1110000010010… |
… | …01001001101110 |
3 | 22012112211010000 |
4 | 13001021021232 |
5 | 220120141032 |
6 | 15403325130 |
7 | 2626526502 |
oct | 701111156 |
9 | 265484100 |
10 | 117740142 |
11 | 60508a03 |
12 | 335207a6 |
13 | 1b515430 |
14 | 118cc302 |
15 | a50ae7c |
hex | 704926e |
117740142 has 80 divisors (see below), whose sum is σ = 291991392. Its totient is φ = 35225280.
The previous prime is 117740111. The next prime is 117740143. The reversal of 117740142 is 241047711.
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (117740143) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 77167 + ... + 78677.
Almost surely, 2117740142 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 117740142, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (145995696).
117740142 is an abundant number, since it is smaller than the sum of its proper divisors (174251250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117740142 is a wasteful number, since it uses less digits than its factorization.
117740142 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1575 (or 1566 counting only the distinct ones).
The product of its (nonzero) digits is 1568, while the sum is 27.
The square root of 117740142 is about 10850.8129649349. The cubic root of 117740142 is about 490.1265007280.
Adding to 117740142 its reverse (241047711), we get a palindrome (358787853).
The spelling of 117740142 in words is "one hundred seventeen million, seven hundred forty thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •