Base | Representation |
---|---|
bin | 111100010011110101… |
… | …100110000001010111 |
3 | 20012011001100000001012 |
4 | 330103311212001113 |
5 | 2030110333412121 |
6 | 45425450122435 |
7 | 4451514121355 |
oct | 742365460127 |
9 | 205131300035 |
10 | 64757325911 |
11 | 25510905473 |
12 | 1067312041b |
13 | 615023ca35 |
14 | 31c46247d5 |
15 | 1a40220c5b |
hex | f13d66057 |
64757325911 has 2 divisors, whose sum is σ = 64757325912. Its totient is φ = 64757325910.
The previous prime is 64757325901. The next prime is 64757325949. The reversal of 64757325911 is 11952375746.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 64757325911 - 226 = 64690217047 is a prime.
It is a super-2 number, since 2×647573259112 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 64757325911.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (64757325901) 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, 32378662955 + 32378662956.
It is an arithmetic number, because the mean of its divisors is an integer number (32378662956).
Almost surely, 264757325911 is an apocalyptic number.
64757325911 is a deficient number, since it is larger than the sum of its proper divisors (1).
64757325911 is an equidigital number, since it uses as much as digits as its factorization.
64757325911 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1587600, while the sum is 50.
The spelling of 64757325911 in words is "sixty-four billion, seven hundred fifty-seven million, three hundred twenty-five thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •