Base | Representation |
---|---|
bin | 11101100110111101001101… |
… | …00010111011111000110001 |
3 | 22112112110211000200020012121 |
4 | 32303132212202323320301 |
5 | 32013231144033303423 |
6 | 350251114200354241 |
7 | 16500025352324122 |
oct | 1663364642737061 |
9 | 275473730606177 |
10 | 65110203416113 |
11 | 1982309a455269 |
12 | 7376963475981 |
13 | 2a43b343217cb |
14 | 12114ca2d4049 |
15 | 77d9ec19d45d |
hex | 3b37a68bbe31 |
65110203416113 has 2 divisors, whose sum is σ = 65110203416114. Its totient is φ = 65110203416112.
The previous prime is 65110203416051. The next prime is 65110203416143. The reversal of 65110203416113 is 31161430201156.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 60285472554384 + 4824730861729 = 7764372^2 + 2196527^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-65110203416113 is a prime.
It is a super-2 number, since 2×651102034161132 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (65110203416143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 32555101708056 + 32555101708057.
It is an arithmetic number, because the mean of its divisors is an integer number (32555101708057).
Almost surely, 265110203416113 is an apocalyptic number.
It is an amenable number.
65110203416113 is a deficient number, since it is larger than the sum of its proper divisors (1).
65110203416113 is an equidigital number, since it uses as much as digits as its factorization.
65110203416113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 34.
Adding to 65110203416113 its reverse (31161430201156), we get a palindrome (96271633617269).
The spelling of 65110203416113 in words is "sixty-five trillion, one hundred ten billion, two hundred three million, four hundred sixteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •