Base | Representation |
---|---|
bin | 1001100110000111101111… |
… | …00001111000001010100111 |
3 | 2202201020110012211000211122 |
4 | 10303003313201320022213 |
5 | 10231204403221223421 |
6 | 112513402543324155 |
7 | 4305333151265156 |
oct | 463036741701247 |
9 | 82636405730748 |
10 | 21101032211111 |
11 | 67a5996642566 |
12 | 2449630bb065b |
13 | ba0a84b966c8 |
14 | 52d41c85959d |
15 | 268d4627c2ab |
hex | 1330f78782a7 |
21101032211111 has 2 divisors, whose sum is σ = 21101032211112. Its totient is φ = 21101032211110.
The previous prime is 21101032211089. The next prime is 21101032211117. The reversal of 21101032211111 is 11111223010112.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 21101032211111 - 210 = 21101032210087 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21101032211111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21101032211117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10550516105555 + 10550516105556.
It is an arithmetic number, because the mean of its divisors is an integer number (10550516105556).
Almost surely, 221101032211111 is an apocalyptic number.
21101032211111 is a deficient number, since it is larger than the sum of its proper divisors (1).
21101032211111 is an equidigital number, since it uses as much as digits as its factorization.
21101032211111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 21101032211111 its reverse (11111223010112), we get a palindrome (32212255221223).
The spelling of 21101032211111 in words is "twenty-one trillion, one hundred one billion, thirty-two million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •