Base | Representation |
---|---|
bin | 111101100010011… |
… | …1111000001100011 |
3 | 12022220111000011201 |
4 | 1323010333001203 |
5 | 13212103414131 |
6 | 540522022031 |
7 | 102112253062 |
oct | 17304770143 |
9 | 5286430151 |
10 | 2064904291 |
11 | 96a64817a |
12 | 497647917 |
13 | 26ba50678 |
14 | 1583521d9 |
15 | c1433761 |
hex | 7b13f063 |
2064904291 has 8 divisors (see below), whose sum is σ = 2102609600. Its totient is φ = 2027488320.
The previous prime is 2064904277. The next prime is 2064904307. The reversal of 2064904291 is 1924094602.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2064904291 - 29 = 2064903779 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2064904291.
It is not an unprimeable number, because it can be changed into a prime (2064904271) 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, 57906 + ... + 86503.
It is an arithmetic number, because the mean of its divisors is an integer number (262826200).
Almost surely, 22064904291 is an apocalyptic number.
2064904291 is a deficient number, since it is larger than the sum of its proper divisors (37705309).
2064904291 is a wasteful number, since it uses less digits than its factorization.
2064904291 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144669.
The product of its (nonzero) digits is 31104, while the sum is 37.
The square root of 2064904291 is about 45441.2179744337. The cubic root of 2064904291 is about 1273.4052682163.
Adding to 2064904291 its reverse (1924094602), we get a palindrome (3988998893).
The spelling of 2064904291 in words is "two billion, sixty-four million, nine hundred four thousand, two hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •