Base | Representation |
---|---|
bin | 1111100110011… |
… | …1100000100001 |
3 | 11120010110212202 |
4 | 3321213200201 |
5 | 113222420211 |
6 | 10254302545 |
7 | 1423123403 |
oct | 371474041 |
9 | 146113782 |
10 | 65435681 |
11 | 33a33883 |
12 | 19ab7a55 |
13 | 1073114c |
14 | 8994b73 |
15 | 5b2853b |
hex | 3e67821 |
65435681 has 2 divisors, whose sum is σ = 65435682. Its totient is φ = 65435680.
The previous prime is 65435653. The next prime is 65435683. The reversal of 65435681 is 18653456.
65435681 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., 55726225 + 9709456 = 7465^2 + 3116^2 .
It is a cyclic number.
It is not a de Polignac number, because 65435681 - 210 = 65434657 is a prime.
It is a super-2 number, since 2×654356812 = 8563656695867522, which contains 22 as substring.
Together with 65435683, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (65435683) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 32717840 + 32717841.
It is an arithmetic number, because the mean of its divisors is an integer number (32717841).
Almost surely, 265435681 is an apocalyptic number.
It is an amenable number.
65435681 is a deficient number, since it is larger than the sum of its proper divisors (1).
65435681 is an equidigital number, since it uses as much as digits as its factorization.
65435681 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 86400, while the sum is 38.
The square root of 65435681 is about 8089.2324110511. The cubic root of 65435681 is about 402.9689114756.
The spelling of 65435681 in words is "sixty-five million, four hundred thirty-five thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •