Base | Representation |
---|---|
bin | 111111011101110… |
… | …000011000001011 |
3 | 2202012112122220111 |
4 | 333131300120023 |
5 | 4140034434224 |
6 | 253353335151 |
7 | 35246231650 |
oct | 7735603013 |
9 | 2665478814 |
10 | 1064764939 |
11 | 4a7039727 |
12 | 2587074b7 |
13 | 13c794c34 |
14 | a15a9c27 |
15 | 63725d94 |
hex | 3f77060b |
1064764939 has 8 divisors (see below), whose sum is σ = 1230547680. Its totient is φ = 902400576.
The previous prime is 1064764937. The next prime is 1064764949. The reversal of 1064764939 is 9394674601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1064764939 - 21 = 1064764937 is a prime.
It is a super-2 number, since 2×10647649392 = 2267448750647347442, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1064764892 and 1064764901.
It is not an unprimeable number, because it can be changed into a prime (1064764937) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 853924 + ... + 855169.
It is an arithmetic number, because the mean of its divisors is an integer number (153818460).
Almost surely, 21064764939 is an apocalyptic number.
1064764939 is a deficient number, since it is larger than the sum of its proper divisors (165782741).
1064764939 is an equidigital number, since it uses as much as digits as its factorization.
1064764939 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1709189.
The product of its (nonzero) digits is 979776, while the sum is 49.
The square root of 1064764939 is about 32630.7361087671. The cubic root of 1064764939 is about 1021.1383353692.
The spelling of 1064764939 in words is "one billion, sixty-four million, seven hundred sixty-four thousand, nine hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •