Base | Representation |
---|---|
bin | 101111111110100111010100… |
… | …010010111100101011011111 |
3 | 1000200010110022002120210212112 |
4 | 233332213110102330223133 |
5 | 210124201022031201421 |
6 | 2024441041512024235 |
7 | 62306020352245025 |
oct | 5776472422745337 |
9 | 1020113262523775 |
10 | 211011010022111 |
11 | 612642a3125892 |
12 | 1b7bb42039207b |
13 | 9098339709200 |
14 | 3a16db7518715 |
15 | 195dd3211745b |
hex | bfe9d44bcadf |
211011010022111 has 12 divisors (see below), whose sum is σ = 230753501282520. Its totient is φ = 192850885000800.
The previous prime is 211011010022089. The next prime is 211011010022143. The reversal of 211011010022111 is 111220010110112.
It is not a de Polignac number, because 211011010022111 - 226 = 211010942913247 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211011010022161) 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 in 11 ways as a sum of consecutive naturals, for example, 6181101041 + ... + 6181135178.
It is an arithmetic number, because the mean of its divisors is an integer number (19229458440210).
Almost surely, 2211011010022111 is an apocalyptic number.
211011010022111 is a deficient number, since it is larger than the sum of its proper divisors (19742491260409).
211011010022111 is a wasteful number, since it uses less digits than its factorization.
211011010022111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12362236346 (or 12362236333 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 211011010022111 its reverse (111220010110112), we get a palindrome (322231020132223).
The spelling of 211011010022111 in words is "two hundred eleven trillion, eleven billion, ten million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •