Base | Representation |
---|---|
bin | 111101100010011… |
… | …1110110000101001 |
3 | 12022220110221200122 |
4 | 1323010332300221 |
5 | 13212103400314 |
6 | 540522013025 |
7 | 102112246655 |
oct | 17304766051 |
9 | 5286427618 |
10 | 2064903209 |
11 | 96a647386 |
12 | 497647175 |
13 | 26ba50025 |
14 | 158351a65 |
15 | c143328e |
hex | 7b13ec29 |
2064903209 has 4 divisors (see below), whose sum is σ = 2072754816. Its totient is φ = 2057051604.
The previous prime is 2064903173. The next prime is 2064903229. The reversal of 2064903209 is 9023094602.
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: 9023094602 = 2 ⋅4511547301.
It is a cyclic number.
It is not a de Polignac number, because 2064903209 - 28 = 2064902953 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2064903229) 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, 3925409 + ... + 3925934.
It is an arithmetic number, because the mean of its divisors is an integer number (518188704).
Almost surely, 22064903209 is an apocalyptic number.
It is an amenable number.
2064903209 is a deficient number, since it is larger than the sum of its proper divisors (7851607).
2064903209 is an equidigital number, since it uses as much as digits as its factorization.
2064903209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7851606.
The product of its (nonzero) digits is 23328, while the sum is 35.
The square root of 2064903209 is about 45441.2060689414. The cubic root of 2064903209 is about 1273.4050457969.
The spelling of 2064903209 in words is "two billion, sixty-four million, nine hundred three thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •