Base | Representation |
---|---|
bin | 11101101111111001110100… |
… | …00001000100110111001001 |
3 | 22120121212022102200020210111 |
4 | 32313330322001010313021 |
5 | 32033300241240332321 |
6 | 351044235002114321 |
7 | 16531160420264224 |
oct | 1667747201046711 |
9 | 276555272606714 |
10 | 65417620245961 |
11 | 19931503216605 |
12 | 74064587ab9a1 |
13 | 2a66b1690b119 |
14 | 12223304985bb |
15 | 7869e0a615e1 |
hex | 3b7f3a044dc9 |
65417620245961 has 2 divisors, whose sum is σ = 65417620245962. Its totient is φ = 65417620245960.
The previous prime is 65417620245931. The next prime is 65417620245973. The reversal of 65417620245961 is 16954202671456.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 57319435321600 + 8098184924361 = 7570960^2 + 2845731^2 .
It is a cyclic number.
It is not a de Polignac number, because 65417620245961 - 29 = 65417620245449 is a prime.
It is a super-2 number, since 2×654176202459612 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 65417620245896 and 65417620245905.
It is not a weakly prime, because it can be changed into another prime (65417620245931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 32708810122980 + 32708810122981.
It is an arithmetic number, because the mean of its divisors is an integer number (32708810122981).
Almost surely, 265417620245961 is an apocalyptic number.
It is an amenable number.
65417620245961 is a deficient number, since it is larger than the sum of its proper divisors (1).
65417620245961 is an equidigital number, since it uses as much as digits as its factorization.
65417620245961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21772800, while the sum is 58.
The spelling of 65417620245961 in words is "sixty-five trillion, four hundred seventeen billion, six hundred twenty million, two hundred forty-five thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •