Base | Representation |
---|---|
bin | 11010100001101011001100… |
… | …100010110010101101010011 |
3 | 120022001220110021211202121101 |
4 | 122201223030202302231103 |
5 | 110242403001320212421 |
6 | 1052042221231005231 |
7 | 33400435104565543 |
oct | 3241531442625523 |
9 | 508056407752541 |
10 | 116663333366611 |
11 | 34199707307939 |
12 | 11102176369817 |
13 | 50133c74b13c5 |
14 | 20b476d44b323 |
15 | d74a33710191 |
hex | 6a1acc8b2b53 |
116663333366611 has 2 divisors, whose sum is σ = 116663333366612. Its totient is φ = 116663333366610.
The previous prime is 116663333366609. The next prime is 116663333366623.
116663333366611 is nontrivially palindromic in base 10.
It is a weak prime.
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 116663333366611 - 21 = 116663333366609 is a prime.
It is a super-2 number, since 2×1166633333666112 (a number of 29 digits) contains 22 as substring.
Together with 116663333366609, it forms a pair of twin primes.
It is a zygodrome in base 10.
It is not a weakly prime, because it can be changed into another prime (116663333366011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58331666683305 + 58331666683306.
It is an arithmetic number, because the mean of its divisors is an integer number (58331666683306).
Almost surely, 2116663333366611 is an apocalyptic number.
116663333366611 is a deficient number, since it is larger than the sum of its proper divisors (1).
116663333366611 is an equidigital number, since it uses as much as digits as its factorization.
116663333366611 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 11337408, while the sum is 55.
The spelling of 116663333366611 in words is "one hundred sixteen trillion, six hundred sixty-three billion, three hundred thirty-three million, three hundred sixty-six thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •