Base | Representation |
---|---|
bin | 11101110010011110100100… |
… | …01000100111110110000001 |
3 | 22120221022121202201000211022 |
4 | 32321033102020213312001 |
5 | 32041222413324111014 |
6 | 351153023543555225 |
7 | 16540441344302033 |
oct | 1671172210476601 |
9 | 276838552630738 |
10 | 65506071707009 |
11 | 19965a7281443a |
12 | 741b622a5bb15 |
13 | 2a72271974a5b |
14 | 1226721859c53 |
15 | 788e6aea6a8e |
hex | 3b93d2227d81 |
65506071707009 has 2 divisors, whose sum is σ = 65506071707010. Its totient is φ = 65506071707008.
The previous prime is 65506071706973. The next prime is 65506071707029. The reversal of 65506071707009 is 90070717060556.
65506071707009 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 65050273890625 + 455797816384 = 8065375^2 + 675128^2 .
It is a cyclic number.
It is not a de Polignac number, because 65506071707009 - 28 = 65506071706753 is a prime.
It is not a weakly prime, because it can be changed into another prime (65506071707029) 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, 32753035853504 + 32753035853505.
It is an arithmetic number, because the mean of its divisors is an integer number (32753035853505).
Almost surely, 265506071707009 is an apocalyptic number.
It is an amenable number.
65506071707009 is a deficient number, since it is larger than the sum of its proper divisors (1).
65506071707009 is an equidigital number, since it uses as much as digits as its factorization.
65506071707009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2778300, while the sum is 53.
The spelling of 65506071707009 in words is "sixty-five trillion, five hundred six billion, seventy-one million, seven hundred seven thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •