Base | Representation |
---|---|
bin | 11101011100001100100110… |
… | …10111101001100001101001 |
3 | 22111020010120202202121020121 |
4 | 32232012103113221201221 |
5 | 31441202033203042021 |
6 | 345405214244123241 |
7 | 16431230205365116 |
oct | 1656062327514151 |
9 | 274203522677217 |
10 | 64740514502761 |
11 | 196a03307229a9 |
12 | 731718b396521 |
13 | 2a180096586c6 |
14 | 11db6599d790d |
15 | 7740b187c741 |
hex | 3ae1935e9869 |
64740514502761 has 4 divisors (see below), whose sum is σ = 65837811358800. Its totient is φ = 63643217646724.
The previous prime is 64740514502701. The next prime is 64740514502771. The reversal of 64740514502761 is 16720541504746.
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 a de Polignac number, because none of the positive numbers 2k-64740514502761 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 64740514502699 and 64740514502708.
It is not an unprimeable number, because it can be changed into a prime (64740514502701) 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, 548648427931 + ... + 548648428048.
It is an arithmetic number, because the mean of its divisors is an integer number (16459452839700).
Almost surely, 264740514502761 is an apocalyptic number.
It is an amenable number.
64740514502761 is a deficient number, since it is larger than the sum of its proper divisors (1097296856039).
64740514502761 is a wasteful number, since it uses less digits than its factorization.
64740514502761 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1097296856038.
The product of its (nonzero) digits is 5644800, while the sum is 52.
The spelling of 64740514502761 in words is "sixty-four trillion, seven hundred forty billion, five hundred fourteen million, five hundred two thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •