Base | Representation |
---|---|
bin | 110110101001100011… |
… | …1001001100011101001 |
3 | 102012220220201111210211 |
4 | 1231103013021203221 |
5 | 3410322234000243 |
6 | 125525211541121 |
7 | 11323152535303 |
oct | 1552307114351 |
9 | 365826644724 |
10 | 117358500073 |
11 | 458538a5131 |
12 | 1a8b315a7a1 |
13 | b0b3b73c69 |
14 | 59745c0973 |
15 | 30bd128d9d |
hex | 1b531c98e9 |
117358500073 has 2 divisors, whose sum is σ = 117358500074. Its totient is φ = 117358500072.
The previous prime is 117358500037. The next prime is 117358500079. The reversal of 117358500073 is 370005853711.
Together with previous prime (117358500037) 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., 113240326144 + 4118173929 = 336512^2 + 64173^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-117358500073 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 117358499999 and 117358500035.
It is not a weakly prime, because it can be changed into another prime (117358500079) 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, 58679250036 + 58679250037.
It is an arithmetic number, because the mean of its divisors is an integer number (58679250037).
Almost surely, 2117358500073 is an apocalyptic number.
It is an amenable number.
117358500073 is a deficient number, since it is larger than the sum of its proper divisors (1).
117358500073 is an equidigital number, since it uses as much as digits as its factorization.
117358500073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 88200, while the sum is 40.
The spelling of 117358500073 in words is "one hundred seventeen billion, three hundred fifty-eight million, five hundred thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •