Base | Representation |
---|---|
bin | 110110101011001110… |
… | …0001101110010111111 |
3 | 102020001210211012010220 |
4 | 1231112130031302333 |
5 | 3410431033312421 |
6 | 125534525032423 |
7 | 11324431354125 |
oct | 1552634156277 |
9 | 366053735126 |
10 | 117414354111 |
11 | 4588238409a |
12 | 1a9099b5713 |
13 | b0c25cbaa2 |
14 | 597bb9d915 |
15 | 30c2ead3c6 |
hex | 1b5670dcbf |
117414354111 has 4 divisors (see below), whose sum is σ = 156552472152. Its totient is φ = 78276236072.
The previous prime is 117414354011. The next prime is 117414354133. The reversal of 117414354111 is 111453414711.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 117414354111 - 229 = 116877483199 is a prime.
It is a super-2 number, since 2×1174143541112 (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 (117414354181) 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 3 ways as a sum of consecutive naturals, for example, 19569059016 + ... + 19569059021.
It is an arithmetic number, because the mean of its divisors is an integer number (39138118038).
Almost surely, 2117414354111 is an apocalyptic number.
117414354111 is a deficient number, since it is larger than the sum of its proper divisors (39138118041).
117414354111 is an equidigital number, since it uses as much as digits as its factorization.
117414354111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39138118040.
The product of its digits is 6720, while the sum is 33.
Adding to 117414354111 its reverse (111453414711), we get a palindrome (228867768822).
The spelling of 117414354111 in words is "one hundred seventeen billion, four hundred fourteen million, three hundred fifty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •