Base | Representation |
---|---|
bin | 1001100110011010101011… |
… | …00101101101110010111111 |
3 | 2202202012200211200220021012 |
4 | 10303031111211231302333 |
5 | 10231341214223210421 |
6 | 112522203531025435 |
7 | 4306143135663134 |
oct | 463152545556277 |
9 | 82665624626235 |
10 | 21111200210111 |
11 | 67aa234172720 |
12 | 244b5aa29b27b |
13 | ba1a1561546b |
14 | 52db0503058b |
15 | 26923dc7295b |
hex | 13335596dcbf |
21111200210111 has 4 divisors (see below), whose sum is σ = 23030400229224. Its totient is φ = 19192000191000.
The previous prime is 21111200210053. The next prime is 21111200210117. The reversal of 21111200210111 is 11101200211112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21111200210111 - 26 = 21111200210047 is a prime.
It is a super-2 number, since 2×211112002101112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21111200210117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 959600009540 + ... + 959600009561.
It is an arithmetic number, because the mean of its divisors is an integer number (5757600057306).
Almost surely, 221111200210111 is an apocalyptic number.
21111200210111 is a deficient number, since it is larger than the sum of its proper divisors (1919200019113).
21111200210111 is a wasteful number, since it uses less digits than its factorization.
21111200210111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1919200019112.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 21111200210111 its reverse (11101200211112), we get a palindrome (32212400421223).
The spelling of 21111200210111 in words is "twenty-one trillion, one hundred eleven billion, two hundred million, two hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •