Base | Representation |
---|---|
bin | 11101010001000110000… |
… | …011110110101010100111 |
3 | 21010021022101110111100101 |
4 | 131101012003312222213 |
5 | 230422434322004431 |
6 | 4135535230524531 |
7 | 265206623603011 |
oct | 35210603665247 |
9 | 7107271414311 |
10 | 2011220109991 |
11 | 705a54357564 |
12 | 285955666747 |
13 | 117870c67501 |
14 | 6d4b4a991b1 |
15 | 374b3049961 |
hex | 1d4460f6aa7 |
2011220109991 has 2 divisors, whose sum is σ = 2011220109992. Its totient is φ = 2011220109990.
The previous prime is 2011220109959. The next prime is 2011220110021. The reversal of 2011220109991 is 1999010221102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2011220109991 - 25 = 2011220109959 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2011220109991.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2011220109911) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005610054995 + 1005610054996.
It is an arithmetic number, because the mean of its divisors is an integer number (1005610054996).
Almost surely, 22011220109991 is an apocalyptic number.
2011220109991 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011220109991 is an equidigital number, since it uses as much as digits as its factorization.
2011220109991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 37.
The spelling of 2011220109991 in words is "two trillion, eleven billion, two hundred twenty million, one hundred nine thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •