Base | Representation |
---|---|
bin | 1001100110011010101101… |
… | …11000111000010101001011 |
3 | 2202202012202100201111202100 |
4 | 10303031112320320111023 |
5 | 10231341240313324321 |
6 | 112522210030204443 |
7 | 4306143522203163 |
oct | 463152670702513 |
9 | 82665670644670 |
10 | 21111222011211 |
11 | 67aa245503162 |
12 | 244b5b5653723 |
13 | ba1a19ca9617 |
14 | 52db07ca75a3 |
15 | 269240b2c326 |
hex | 133356e3854b |
21111222011211 has 48 divisors (see below), whose sum is σ = 31145785688160. Its totient is φ = 13776523200000.
The previous prime is 21111222011167. The next prime is 21111222011239. The reversal of 21111222011211 is 11211022211112.
It is a happy number.
21111222011211 is a `hidden beast` number, since 211 + 1 + 12 + 220 + 11 + 211 = 666.
It is not a de Polignac number, because 21111222011211 - 27 = 21111222011083 is a prime.
It is not an unprimeable number, because it can be changed into a prime (21111222011261) 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 in 47 ways as a sum of consecutive naturals, for example, 1286398596 + ... + 1286415006.
It is an arithmetic number, because the mean of its divisors is an integer number (648870535170).
Almost surely, 221111222011211 is an apocalyptic number.
21111222011211 is a deficient number, since it is larger than the sum of its proper divisors (10034563676949).
21111222011211 is a wasteful number, since it uses less digits than its factorization.
21111222011211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32508 (or 32505 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 21111222011211 its reverse (11211022211112), we get a palindrome (32322244222323).
The spelling of 21111222011211 in words is "twenty-one trillion, one hundred eleven billion, two hundred twenty-two million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •