Base | Representation |
---|---|
bin | 111101100010100… |
… | …1011111010000101 |
3 | 12022220120200120011 |
4 | 1323011023322011 |
5 | 13212112111221 |
6 | 540523110221 |
7 | 102112562656 |
oct | 17305137205 |
9 | 5286520504 |
10 | 2064957061 |
11 | 96a683892 |
12 | 497672371 |
13 | 26ba6b6ab |
14 | 15836752d |
15 | c14441e1 |
hex | 7b14be85 |
2064957061 has 4 divisors (see below), whose sum is σ = 2080720224. Its totient is φ = 2049193900.
The previous prime is 2064957047. The next prime is 2064957109. The reversal of 2064957061 is 1607594602.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1607594602 = 2 ⋅803797301.
It is a cyclic number.
It is not a de Polignac number, because 2064957061 - 213 = 2064948869 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2064957001) 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 3 ways as a sum of consecutive naturals, for example, 7881385 + ... + 7881646.
It is an arithmetic number, because the mean of its divisors is an integer number (520180056).
Almost surely, 22064957061 is an apocalyptic number.
It is an amenable number.
2064957061 is a deficient number, since it is larger than the sum of its proper divisors (15763163).
2064957061 is a wasteful number, since it uses less digits than its factorization.
2064957061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15763162.
The product of its (nonzero) digits is 90720, while the sum is 40.
The square root of 2064957061 is about 45441.7986109705. The cubic root of 2064957061 is about 1273.4161156963.
The spelling of 2064957061 in words is "two billion, sixty-four million, nine hundred fifty-seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •