Base | Representation |
---|---|
bin | 110110111100011000… |
… | …1001000010100101001 |
3 | 102021112221111100022211 |
4 | 1231320301020110221 |
5 | 3413121001341212 |
6 | 130112020445121 |
7 | 11344623452053 |
oct | 1557061102451 |
9 | 367487440284 |
10 | 117990262057 |
11 | 46048477278 |
12 | 1aa4a8497a1 |
13 | b184a10815 |
14 | 59d44748d3 |
15 | 310881c9a7 |
hex | 1b78c48529 |
117990262057 has 2 divisors, whose sum is σ = 117990262058. Its totient is φ = 117990262056.
The previous prime is 117990262001. The next prime is 117990262063. The reversal of 117990262057 is 750262099711.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 76593883536 + 41396378521 = 276756^2 + 203461^2 .
It is an emirp because it is prime and its reverse (750262099711) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 117990262057 - 219 = 117989737769 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 117990262057.
It is not a weakly prime, because it can be changed into another prime (117990232057) by changing a digit.
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 as a sum of consecutive naturals, namely, 58995131028 + 58995131029.
It is an arithmetic number, because the mean of its divisors is an integer number (58995131029).
Almost surely, 2117990262057 is an apocalyptic number.
It is an amenable number.
117990262057 is a deficient number, since it is larger than the sum of its proper divisors (1).
117990262057 is an equidigital number, since it uses as much as digits as its factorization.
117990262057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 476280, while the sum is 49.
The spelling of 117990262057 in words is "one hundred seventeen billion, nine hundred ninety million, two hundred sixty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •