Base | Representation |
---|---|
bin | 11101110010010100001110… |
… | …01110100100010000000001 |
3 | 22120220210021212012102122202 |
4 | 32321022013032210100001 |
5 | 32041130031110203112 |
6 | 351150305023442545 |
7 | 16540153642521521 |
oct | 1671120716442001 |
9 | 276823255172582 |
10 | 65500520006657 |
11 | 19963683a4882a |
12 | 741a533756455 |
13 | 2a7189872ba68 |
14 | 12263563c5681 |
15 | 788c438c36c2 |
hex | 3b92873a4401 |
65500520006657 has 2 divisors, whose sum is σ = 65500520006658. Its totient is φ = 65500520006656.
The previous prime is 65500520006617. The next prime is 65500520006671. The reversal of 65500520006657 is 75660002500556.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 65290537025536 + 209982981121 = 8080256^2 + 458239^2 .
It is a cyclic number.
It is not a de Polignac number, because 65500520006657 - 226 = 65500452897793 is a prime.
It is a super-2 number, since 2×655005200066572 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (65500520006617) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 32750260003328 + 32750260003329.
It is an arithmetic number, because the mean of its divisors is an integer number (32750260003329).
Almost surely, 265500520006657 is an apocalyptic number.
It is an amenable number.
65500520006657 is a deficient number, since it is larger than the sum of its proper divisors (1).
65500520006657 is an equidigital number, since it uses as much as digits as its factorization.
65500520006657 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1890000, while the sum is 47.
The spelling of 65500520006657 in words is "sixty-five trillion, five hundred billion, five hundred twenty million, six thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •