Base | Representation |
---|---|
bin | 1001101001010100100100… |
… | …01011111110110100111111 |
3 | 2210002202022010201112010021 |
4 | 10310222102023332310333 |
5 | 10240010112241401421 |
6 | 113040111022553011 |
7 | 4316305244513143 |
oct | 464522213766477 |
9 | 83082263645107 |
10 | 21211001122111 |
11 | 6838598188a89 |
12 | 2466a01438767 |
13 | bab25bac9a48 |
14 | 534891869223 |
15 | 26bb30783341 |
hex | 134a922fed3f |
21211001122111 has 4 divisors (see below), whose sum is σ = 21501562781392. Its totient is φ = 20920439462832.
The previous prime is 21211001122061. The next prime is 21211001122183. The reversal of 21211001122111 is 11122110011212.
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 21211001122111 - 29 = 21211001121599 is a prime.
It is a super-2 number, since 2×212110011221112 (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 (21211001152111) 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, 145280829531 + ... + 145280829676.
It is an arithmetic number, because the mean of its divisors is an integer number (5375390695348).
Almost surely, 221211001122111 is an apocalyptic number.
21211001122111 is a deficient number, since it is larger than the sum of its proper divisors (290561659281).
21211001122111 is an equidigital number, since it uses as much as digits as its factorization.
21211001122111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 290561659280.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 21211001122111 its reverse (11122110011212), we get a palindrome (32333111133323).
The spelling of 21211001122111 in words is "twenty-one trillion, two hundred eleven billion, one million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •