Base | Representation |
---|---|
bin | 110110110010100010… |
… | …1111101001011011111 |
3 | 102020200221101021220202 |
4 | 1231211011331023133 |
5 | 3411432001131434 |
6 | 130015145534115 |
7 | 11333505001232 |
oct | 1554505751337 |
9 | 366627337822 |
10 | 117660177119 |
11 | 45999114601 |
12 | 1a9781a433b |
13 | b13150b1a4 |
14 | 59a26ad419 |
15 | 30d9869a7e |
hex | 1b6517d2df |
117660177119 has 8 divisors (see below), whose sum is σ = 127200192240. Its totient is φ = 108454899456.
The previous prime is 117660177083. The next prime is 117660177161. The reversal of 117660177119 is 911771066711.
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 117660177119 - 212 = 117660173023 is a prime.
It is a super-2 number, since 2×1176601771192 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (117660177319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 83683634 + ... + 83685039.
It is an arithmetic number, because the mean of its divisors is an integer number (15900024030).
Almost surely, 2117660177119 is an apocalyptic number.
117660177119 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
117660177119 is a deficient number, since it is larger than the sum of its proper divisors (9540015121).
117660177119 is a wasteful number, since it uses less digits than its factorization.
117660177119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167368729.
The product of its (nonzero) digits is 111132, while the sum is 47.
The spelling of 117660177119 in words is "one hundred seventeen billion, six hundred sixty million, one hundred seventy-seven thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •