Base | Representation |
---|---|
bin | 11110011001100010100… |
… | …100001110110001001001 |
3 | 21101201002112200002100222 |
4 | 132121202210032301021 |
5 | 233211241442130242 |
6 | 4235402114235425 |
7 | 303632363033561 |
oct | 36314244166111 |
9 | 7351075602328 |
10 | 2089007770697 |
11 | 735a41476361 |
12 | 298a44585b75 |
13 | 121cb993a403 |
14 | 73173aa3da1 |
15 | 395171b05d2 |
hex | 1e66290ec49 |
2089007770697 has 4 divisors (see below), whose sum is σ = 2211890580756. Its totient is φ = 1966124960640.
The previous prime is 2089007770687. The next prime is 2089007770727. The reversal of 2089007770697 is 7960777009802.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1282898287801 + 806109482896 = 1132651^2 + 897836^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2089007770697 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2089007770637) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 61441405004 + ... + 61441405037.
It is an arithmetic number, because the mean of its divisors is an integer number (552972645189).
Almost surely, 22089007770697 is an apocalyptic number.
It is an amenable number.
2089007770697 is a deficient number, since it is larger than the sum of its proper divisors (122882810059).
2089007770697 is a wasteful number, since it uses less digits than its factorization.
2089007770697 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122882810058.
The product of its (nonzero) digits is 18670176, while the sum is 62.
The spelling of 2089007770697 in words is "two trillion, eighty-nine billion, seven million, seven hundred seventy thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •