Base | Representation |
---|---|
bin | 100110110001110000111… |
… | …110000001100011001111 |
3 | 100102202020202100102022012 |
4 | 212301300332001203033 |
5 | 322124424401442431 |
6 | 5400103013011435 |
7 | 363344416014653 |
oct | 46616076014317 |
9 | 10382222312265 |
10 | 2664775030991 |
11 | 938141041947 |
12 | 37054b923b7b |
13 | 164396cc0288 |
14 | 92d93846a63 |
15 | 494b48b722b |
hex | 26c70f818cf |
2664775030991 has 4 divisors (see below), whose sum is σ = 2729769543984. Its totient is φ = 2599780518000.
The previous prime is 2664775030963. The next prime is 2664775031033. The reversal of 2664775030991 is 1990305774662.
2664775030991 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2664775030991 - 26 = 2664775030927 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 2664775030991.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2664775000991) 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, 32497256435 + ... + 32497256516.
It is an arithmetic number, because the mean of its divisors is an integer number (682442385996).
Almost surely, 22664775030991 is an apocalyptic number.
2664775030991 is a deficient number, since it is larger than the sum of its proper divisors (64994512993).
2664775030991 is an equidigital number, since it uses as much as digits as its factorization.
2664775030991 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64994512992.
The product of its (nonzero) digits is 17146080, while the sum is 59.
The spelling of 2664775030991 in words is "two trillion, six hundred sixty-four billion, seven hundred seventy-five million, thirty thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •