Base | Representation |
---|---|
bin | 11010110100100111011010… |
… | …010111010000100111010101 |
3 | 120110200100010111221122201222 |
4 | 122310213122113100213111 |
5 | 110430214144210040333 |
6 | 1054520202341100125 |
7 | 33563454122240234 |
oct | 3264473227204725 |
9 | 513610114848658 |
10 | 117964940315093 |
11 | 34650717517223 |
12 | 1129248b9b7645 |
13 | 50a907a4a5221 |
14 | 211b7681b8b1b |
15 | d98813758298 |
hex | 6b49da5d09d5 |
117964940315093 has 2 divisors, whose sum is σ = 117964940315094. Its totient is φ = 117964940315092.
The previous prime is 117964940315039. The next prime is 117964940315099. The reversal of 117964940315093 is 390513049469711.
Together with previous prime (117964940315039) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113615517447364 + 4349422867729 = 10659058^2 + 2085527^2 .
It is a cyclic number.
It is not a de Polignac number, because 117964940315093 - 230 = 117963866573269 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (117964940315099) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58982470157546 + 58982470157547.
It is an arithmetic number, because the mean of its divisors is an integer number (58982470157547).
Almost surely, 2117964940315093 is an apocalyptic number.
It is an amenable number.
117964940315093 is a deficient number, since it is larger than the sum of its proper divisors (1).
117964940315093 is an equidigital number, since it uses as much as digits as its factorization.
117964940315093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22044960, while the sum is 62.
The spelling of 117964940315093 in words is "one hundred seventeen trillion, nine hundred sixty-four billion, nine hundred forty million, three hundred fifteen thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •