Base | Representation |
---|---|
bin | 11000100101010011111000… |
… | …101010001010011110110101 |
3 | 112011210220002210111221202001 |
4 | 120211103320222022132311 |
5 | 103132342244133434321 |
6 | 1021540145501215301 |
7 | 31526126146510525 |
oct | 3045237052123665 |
9 | 464726083457661 |
10 | 108117088577461 |
11 | 314a42219936a7 |
12 | 10161996261531 |
13 | 48435229b4522 |
14 | 1c9ac75c8b685 |
15 | c77590ce1c91 |
hex | 6254f8a8a7b5 |
108117088577461 has 2 divisors, whose sum is σ = 108117088577462. Its totient is φ = 108117088577460.
The previous prime is 108117088577419. The next prime is 108117088577497. The reversal of 108117088577461 is 164775880711801.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106455036467025 + 1662052110436 = 10317705^2 + 1289206^2 .
It is a cyclic number.
It is not a de Polignac number, because 108117088577461 - 221 = 108117086480309 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 108117088577393 and 108117088577402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (108117088577761) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54058544288730 + 54058544288731.
It is an arithmetic number, because the mean of its divisors is an integer number (54058544288731).
Almost surely, 2108117088577461 is an apocalyptic number.
It is an amenable number.
108117088577461 is a deficient number, since it is larger than the sum of its proper divisors (1).
108117088577461 is an equidigital number, since it uses as much as digits as its factorization.
108117088577461 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 21073920, while the sum is 64.
The spelling of 108117088577461 in words is "one hundred eight trillion, one hundred seventeen billion, eighty-eight million, five hundred seventy-seven thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.165 sec. • engine limits •