Base | Representation |
---|---|
bin | 101111111111111010001100… |
… | …100100111110010100110111 |
3 | 1000200102222000001000000120102 |
4 | 233333322030210332110313 |
5 | 210132130300240213421 |
6 | 2024550000211424315 |
7 | 62315320551033653 |
oct | 5777721444762467 |
9 | 1020388001000512 |
10 | 211100001101111 |
11 | 6129900a28a671 |
12 | 1b8147172b509b |
13 | 90a384c4b98c5 |
14 | 3a1b41a425a63 |
15 | 19612deaee60b |
hex | bffe8c93e537 |
211100001101111 has 2 divisors, whose sum is σ = 211100001101112. Its totient is φ = 211100001101110.
The previous prime is 211100001101083. The next prime is 211100001101131. The reversal of 211100001101111 is 111101100001112.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 211100001101111 - 218 = 211100000838967 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 211100001101092 and 211100001101101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211100001101131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105550000550555 + 105550000550556.
It is an arithmetic number, because the mean of its divisors is an integer number (105550000550556).
Almost surely, 2211100001101111 is an apocalyptic number.
211100001101111 is a deficient number, since it is larger than the sum of its proper divisors (1).
211100001101111 is an equidigital number, since it uses as much as digits as its factorization.
211100001101111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 211100001101111 its reverse (111101100001112), we get a palindrome (322201101102223).
The spelling of 211100001101111 in words is "two hundred eleven trillion, one hundred billion, one million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •