Base | Representation |
---|---|
bin | 101111110001100010001111… |
… | …000110101101101010011111 |
3 | 1000112221112022112212210111022 |
4 | 233301202033012231222133 |
5 | 210014434241430201421 |
6 | 2022512113531514355 |
7 | 62154051132636503 |
oct | 5761421706555237 |
9 | 1015845275783438 |
10 | 210112201022111 |
11 | 60a480a1954a13 |
12 | 1b69519abb89bb |
13 | 9031659912c3b |
14 | 39c56b039c303 |
15 | 19457794497ab |
hex | bf188f1ada9f |
210112201022111 has 2 divisors, whose sum is σ = 210112201022112. Its totient is φ = 210112201022110.
The previous prime is 210112201022069. The next prime is 210112201022123. The reversal of 210112201022111 is 111220102211012.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210112201022111 is a prime.
It is a super-2 number, since 2×2101122010221112 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 210112201022111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210112201022411) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105056100511055 + 105056100511056.
It is an arithmetic number, because the mean of its divisors is an integer number (105056100511056).
Almost surely, 2210112201022111 is an apocalyptic number.
210112201022111 is a deficient number, since it is larger than the sum of its proper divisors (1).
210112201022111 is an equidigital number, since it uses as much as digits as its factorization.
210112201022111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 210112201022111 its reverse (111220102211012), we get a palindrome (321332303233123).
The spelling of 210112201022111 in words is "two hundred ten trillion, one hundred twelve billion, two hundred one million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •