Base | Representation |
---|---|
bin | 11101100111000011001101… |
… | …11100011011010110001001 |
3 | 22112112210010222112221110002 |
4 | 32303201212330123112021 |
5 | 32013304301404332131 |
6 | 350252410345532345 |
7 | 16500201346150322 |
oct | 1663414674332611 |
9 | 275483128487402 |
10 | 65113431324041 |
11 | 198244a652a271 |
12 | 73775044a40b5 |
13 | 2a44229cb1cb9 |
14 | 1211714ca5449 |
15 | 77db3a7606cb |
hex | 3b3866f1b589 |
65113431324041 has 2 divisors, whose sum is σ = 65113431324042. Its totient is φ = 65113431324040.
The previous prime is 65113431324031. The next prime is 65113431324091. The reversal of 65113431324041 is 14042313431156.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 33715395798016 + 31398035526025 = 5806496^2 + 5603395^2 .
It is a cyclic number.
It is not a de Polignac number, because 65113431324041 - 238 = 64838553417097 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 65113431323986 and 65113431324004.
It is not a weakly prime, because it can be changed into another prime (65113431324031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 32556715662020 + 32556715662021.
It is an arithmetic number, because the mean of its divisors is an integer number (32556715662021).
Almost surely, 265113431324041 is an apocalyptic number.
It is an amenable number.
65113431324041 is a deficient number, since it is larger than the sum of its proper divisors (1).
65113431324041 is an equidigital number, since it uses as much as digits as its factorization.
65113431324041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 103680, while the sum is 38.
Adding to 65113431324041 its reverse (14042313431156), we get a palindrome (79155744755197).
The spelling of 65113431324041 in words is "sixty-five trillion, one hundred thirteen billion, four hundred thirty-one million, three hundred twenty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •