Base | Representation |
---|---|
bin | 111101100000111… |
… | …0111000001000101 |
3 | 12022211221101101212 |
4 | 1323001313001011 |
5 | 13211401210221 |
6 | 540452301205 |
7 | 102102301463 |
oct | 17301670105 |
9 | 5284841355 |
10 | 2064085061 |
11 | 96a138725 |
12 | 497311805 |
13 | 26b82480c |
14 | 1581bb833 |
15 | c1320b5b |
hex | 7b077045 |
2064085061 has 4 divisors (see below), whose sum is σ = 2090212800. Its totient is φ = 2037957324.
The previous prime is 2064085003. The next prime is 2064085069. The reversal of 2064085061 is 1605804602.
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: 1605804602 = 2 ⋅802902301.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2064085061 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 (2064085069) 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, 13063751 + ... + 13063908.
It is an arithmetic number, because the mean of its divisors is an integer number (522553200).
Almost surely, 22064085061 is an apocalyptic number.
It is an amenable number.
2064085061 is a deficient number, since it is larger than the sum of its proper divisors (26127739).
2064085061 is an equidigital number, since it uses as much as digits as its factorization.
2064085061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26127738.
The product of its (nonzero) digits is 11520, while the sum is 32.
The square root of 2064085061 is about 45432.2029071891. The cubic root of 2064085061 is about 1273.2368423650.
Adding to 2064085061 its reverse (1605804602), we get a palindrome (3669889663).
The spelling of 2064085061 in words is "two billion, sixty-four million, eighty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •