Base | Representation |
---|---|
bin | 11010101011110110011110… |
… | …101111101011110110111101 |
3 | 120101112202111111102102121121 |
4 | 122223312132233223312331 |
5 | 110340332144013214431 |
6 | 1053335353223030541 |
7 | 33502112512542151 |
oct | 3253663657536675 |
9 | 511482444372547 |
10 | 117362644663741 |
11 | 34439244302904 |
12 | 111b580029b451 |
13 | 5064333066049 |
14 | 20da54d0b9061 |
15 | d87d120c7611 |
hex | 6abd9ebebdbd |
117362644663741 has 2 divisors, whose sum is σ = 117362644663742. Its totient is φ = 117362644663740.
The previous prime is 117362644663661. The next prime is 117362644663879. The reversal of 117362644663741 is 147366446263711.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 114133539888900 + 3229104774841 = 10683330^2 + 1796971^2 .
It is a cyclic number.
It is not a de Polignac number, because 117362644663741 - 229 = 117362107792829 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 117362644663741.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111362644663741) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58681322331870 + 58681322331871.
It is an arithmetic number, because the mean of its divisors is an integer number (58681322331871).
Almost surely, 2117362644663741 is an apocalyptic number.
It is an amenable number.
117362644663741 is a deficient number, since it is larger than the sum of its proper divisors (1).
117362644663741 is an equidigital number, since it uses as much as digits as its factorization.
117362644663741 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 73156608, while the sum is 61.
The spelling of 117362644663741 in words is "one hundred seventeen trillion, three hundred sixty-two billion, six hundred forty-four million, six hundred sixty-three thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •