Base | Representation |
---|---|
bin | 11010100001101100101111… |
… | …111011001011111010010001 |
3 | 120022002001202111020100211021 |
4 | 122201230233323023322101 |
5 | 110242414410140040211 |
6 | 1052043054511515441 |
7 | 33400524322000441 |
oct | 3241545773137221 |
9 | 508061674210737 |
10 | 116665000705681 |
11 | 3419a3924a240a |
12 | 11102560828b81 |
13 | 5013601a6377c |
14 | 20b488aa70121 |
15 | d74acecb1771 |
hex | 6a1b2fecbe91 |
116665000705681 has 2 divisors, whose sum is σ = 116665000705682. Its totient is φ = 116665000705680.
The previous prime is 116665000705679. The next prime is 116665000705793. The reversal of 116665000705681 is 186507000566611.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 108413055041281 + 8251945664400 = 10412159^2 + 2872620^2 .
It is a cyclic number.
It is not a de Polignac number, because 116665000705681 - 21 = 116665000705679 is a prime.
It is a super-2 number, since 2×1166650007056812 (a number of 29 digits) contains 22 as substring.
Together with 116665000705679, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (116665000705381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58332500352840 + 58332500352841.
It is an arithmetic number, because the mean of its divisors is an integer number (58332500352841).
Almost surely, 2116665000705681 is an apocalyptic number.
It is an amenable number.
116665000705681 is a deficient number, since it is larger than the sum of its proper divisors (1).
116665000705681 is an equidigital number, since it uses as much as digits as its factorization.
116665000705681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1814400, while the sum is 52.
The spelling of 116665000705681 in words is "one hundred sixteen trillion, six hundred sixty-five billion, seven hundred five thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •