Base | Representation |
---|---|
bin | 10110111111010111001010… |
… | …011110001000100011001111 |
3 | 111021000010201220120120121122 |
4 | 112333113022132020203033 |
5 | 101223101240313341421 |
6 | 555013504254551155 |
7 | 30204021224326253 |
oct | 2677271236104317 |
9 | 437003656516548 |
10 | 101111222012111 |
11 | 2a243034952a43 |
12 | b4100478084bb |
13 | 4455993b3c06c |
14 | 1ad7b4885c263 |
15 | ba52055662ab |
hex | 5bf5ca7888cf |
101111222012111 has 16 divisors (see below), whose sum is σ = 102861050757120. Its totient is φ = 99362602072800.
The previous prime is 101111222012093. The next prime is 101111222012137. The reversal of 101111222012111 is 111210222111101.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101111222012111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101111222012111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101111222912111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2607082226 + ... + 2607121008.
It is an arithmetic number, because the mean of its divisors is an integer number (6428815672320).
Almost surely, 2101111222012111 is an apocalyptic number.
101111222012111 is a deficient number, since it is larger than the sum of its proper divisors (1749828745009).
101111222012111 is an equidigital number, since it uses as much as digits as its factorization.
101111222012111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53206.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 101111222012111 its reverse (111210222111101), we get a palindrome (212321444123212).
The spelling of 101111222012111 in words is "one hundred one trillion, one hundred eleven billion, two hundred twenty-two million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •