Base | Representation |
---|---|
bin | 111100101011110010… |
… | …110001110000001001 |
3 | 20020012001121101111121 |
4 | 330223302301300021 |
5 | 2031421231200323 |
6 | 45533404355241 |
7 | 4464464256550 |
oct | 745362616011 |
9 | 206161541447 |
10 | 65159240713 |
11 | 256a7768a66 |
12 | 10765845b21 |
13 | 61b55a1a48 |
14 | 3221b66d97 |
15 | 1a65661a5d |
hex | f2bcb1c09 |
65159240713 has 4 divisors (see below), whose sum is σ = 74467703680. Its totient is φ = 55850777748.
The previous prime is 65159240711. The next prime is 65159240743. The reversal of 65159240713 is 31704295156.
65159240713 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 65159240713 - 21 = 65159240711 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 65159240713.
It is not an unprimeable number, because it can be changed into a prime (65159240711) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4654231473 + ... + 4654231486.
It is an arithmetic number, because the mean of its divisors is an integer number (18616925920).
Almost surely, 265159240713 is an apocalyptic number.
It is an amenable number.
65159240713 is a deficient number, since it is larger than the sum of its proper divisors (9308462967).
65159240713 is an equidigital number, since it uses as much as digits as its factorization.
65159240713 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9308462966.
The product of its (nonzero) digits is 226800, while the sum is 43.
The spelling of 65159240713 in words is "sixty-five billion, one hundred fifty-nine million, two hundred forty thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •