Base | Representation |
---|---|
bin | 1101111101101… |
… | …10111001001010 |
3 | 22011102101100000 |
4 | 12332312321022 |
5 | 214442003231 |
6 | 15342423430 |
7 | 2621453100 |
oct | 676667112 |
9 | 264371300 |
10 | 117141066 |
11 | 601398a9 |
12 | 33291b76 |
13 | 1b365853 |
14 | 117b3c70 |
15 | a43d6e6 |
hex | 6fb6e4a |
117141066 has 72 divisors (see below), whose sum is σ = 306240480. Its totient is φ = 33462072.
The previous prime is 117141053. The next prime is 117141071. The reversal of 117141066 is 660141711.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
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 35 ways as a sum of consecutive naturals, for example, 21355 + ... + 26273.
It is an arithmetic number, because the mean of its divisors is an integer number (4253340).
Almost surely, 2117141066 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 117141066, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (153120240).
117141066 is an abundant number, since it is smaller than the sum of its proper divisors (189099414).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117141066 is an equidigital number, since it uses as much as digits as its factorization.
117141066 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4950 (or 4931 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 27.
The square root of 117141066 is about 10823.1726402197. The cubic root of 117141066 is about 489.2938126647.
Adding to 117141066 its reverse (660141711), we get a palindrome (777282777).
The spelling of 117141066 in words is "one hundred seventeen million, one hundred forty-one thousand, sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •