Base | Representation |
---|---|
bin | 100000000111000100110… |
… | …101100111011011010111 |
3 | 21210221200011222111011212 |
4 | 200013010311213123113 |
5 | 242123124334043221 |
6 | 4405412453452035 |
7 | 315265054505543 |
oct | 40070465473327 |
9 | 7727604874155 |
10 | 2206620612311 |
11 | 78090589a005 |
12 | 2b77a894101b |
13 | 1301113b3c0b |
14 | 78b2dd70a23 |
15 | 3c5ec7c9b5b |
hex | 201c4d676d7 |
2206620612311 has 8 divisors (see below), whose sum is σ = 2209794223680. Its totient is φ = 2203447292928.
The previous prime is 2206620612271. The next prime is 2206620612331. The reversal of 2206620612311 is 1132160266022.
2206620612311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2206620612311 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 (2206620612331) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18387575 + ... + 18507191.
It is an arithmetic number, because the mean of its divisors is an integer number (276224277960).
Almost surely, 22206620612311 is an apocalyptic number.
2206620612311 is a deficient number, since it is larger than the sum of its proper divisors (3173611369).
2206620612311 is a wasteful number, since it uses less digits than its factorization.
2206620612311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145993.
The product of its (nonzero) digits is 10368, while the sum is 32.
Adding to 2206620612311 its reverse (1132160266022), we get a palindrome (3338780878333).
The spelling of 2206620612311 in words is "two trillion, two hundred six billion, six hundred twenty million, six hundred twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •