Base | Representation |
---|---|
bin | 100000111010010101100… |
… | …100101000100010011111 |
3 | 22000012202010110011100000 |
4 | 200322111210220202133 |
5 | 244023341011043421 |
6 | 4450554314105343 |
7 | 322254045362520 |
oct | 40722544504237 |
9 | 8005663404300 |
10 | 2261662206111 |
11 | 7a2190399100 |
12 | 3063aa11b253 |
13 | 1353737b6629 |
14 | 7b6720ac847 |
15 | 3dc6ea90226 |
hex | 20e9592889f |
2261662206111 has 144 divisors (see below), whose sum is σ = 4269517021952. Its totient is φ = 1171102458240.
The previous prime is 2261662206109. The next prime is 2261662206121. The reversal of 2261662206111 is 1116022661622.
2261662206111 is a `hidden beast` number, since 2 + 2 + 6 + 16 + 6 + 2 + 20 + 611 + 1 = 666.
It is not a de Polignac number, because 2261662206111 - 21 = 2261662206109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2261662206121) 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 143 ways as a sum of consecutive naturals, for example, 64404420 + ... + 64439526.
Almost surely, 22261662206111 is an apocalyptic number.
2261662206111 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2261662206111 is a deficient number, since it is larger than the sum of its proper divisors (2007854815841).
2261662206111 is a wasteful number, since it uses less digits than its factorization.
2261662206111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35464 (or 35441 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
Adding to 2261662206111 its reverse (1116022661622), we get a palindrome (3377684867733).
The spelling of 2261662206111 in words is "two trillion, two hundred sixty-one billion, six hundred sixty-two million, two hundred six thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •