Base | Representation |
---|---|
bin | 11010110010010001100110… |
… | …110000110001011110000101 |
3 | 120110002221221101011110200002 |
4 | 122302101212300301132011 |
5 | 110420100232241300021 |
6 | 1054314241145331045 |
7 | 33546031045141034 |
oct | 3262214660613605 |
9 | 513087841143602 |
10 | 117804087056261 |
11 | 34599483aa7081 |
12 | 1126727a496a85 |
13 | 5096b54528c28 |
14 | 2113a6923471b |
15 | d9454be2350b |
hex | 6b2466c31785 |
117804087056261 has 2 divisors, whose sum is σ = 117804087056262. Its totient is φ = 117804087056260.
The previous prime is 117804087056207. The next prime is 117804087056273. The reversal of 117804087056261 is 162650780408711.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 77029234156900 + 40774852899361 = 8776630^2 + 6385519^2 .
It is a cyclic number.
It is not a de Polignac number, because 117804087056261 - 246 = 47435342878597 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 117804087056197 and 117804087056206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (117804087056281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58902043528130 + 58902043528131.
It is an arithmetic number, because the mean of its divisors is an integer number (58902043528131).
Almost surely, 2117804087056261 is an apocalyptic number.
It is an amenable number.
117804087056261 is a deficient number, since it is larger than the sum of its proper divisors (1).
117804087056261 is an equidigital number, since it uses as much as digits as its factorization.
117804087056261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4515840, while the sum is 56.
The spelling of 117804087056261 in words is "one hundred seventeen trillion, eight hundred four billion, eighty-seven million, fifty-six thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •