Base | Representation |
---|---|
bin | 110110111100100001… |
… | …0000001001001111111 |
3 | 102021120020211021011021 |
4 | 1231321002001021333 |
5 | 3413123120023101 |
6 | 130112255405011 |
7 | 11345006211043 |
oct | 1557102011177 |
9 | 367506737137 |
10 | 117994689151 |
11 | 4604aa20429 |
12 | 1aa50223767 |
13 | b1859008c1 |
14 | 59d4ca8023 |
15 | 3108de45a1 |
hex | 1b7908127f |
117994689151 has 2 divisors, whose sum is σ = 117994689152. Its totient is φ = 117994689150.
The previous prime is 117994689119. The next prime is 117994689167. The reversal of 117994689151 is 151986499711.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 117994689151 - 25 = 117994689119 is a prime.
It is a super-2 number, since 2×1179946891512 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 117994689151.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (117994689191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58997344575 + 58997344576.
It is an arithmetic number, because the mean of its divisors is an integer number (58997344576).
Almost surely, 2117994689151 is an apocalyptic number.
117994689151 is a deficient number, since it is larger than the sum of its proper divisors (1).
117994689151 is an equidigital number, since it uses as much as digits as its factorization.
117994689151 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4898880, while the sum is 61.
The spelling of 117994689151 in words is "one hundred seventeen billion, nine hundred ninety-four million, six hundred eighty-nine thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •