Base | Representation |
---|---|
bin | 1001100110101110111111… |
… | …10111010001010000100011 |
3 | 2202210020212011101202112021 |
4 | 10303113133313101100203 |
5 | 10232031040130032321 |
6 | 112531210253442311 |
7 | 4310010401456161 |
oct | 463273767212043 |
9 | 82706764352467 |
10 | 21122110002211 |
11 | 6803922497a29 |
12 | 2451733aa0397 |
13 | ba2a6394734a |
14 | 53045bd3c231 |
15 | 26967b943941 |
hex | 1335dfdd1423 |
21122110002211 has 8 divisors (see below), whose sum is σ = 21361397477504. Its totient is φ = 20883261991680.
The previous prime is 21122110002181. The next prime is 21122110002221. The reversal of 21122110002211 is 11220001122112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21122110002211 - 213 = 21122109994019 is a prime.
It is a super-2 number, since 2×211221100022112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21122110002221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 109769520 + ... + 109961773.
It is an arithmetic number, because the mean of its divisors is an integer number (2670174684688).
Almost surely, 221122110002211 is an apocalyptic number.
21122110002211 is a deficient number, since it is larger than the sum of its proper divisors (239287475293).
21122110002211 is an equidigital number, since it uses as much as digits as its factorization.
21122110002211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219732381.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 21122110002211 its reverse (11220001122112), we get a palindrome (32342111124323).
The spelling of 21122110002211 in words is "twenty-one trillion, one hundred twenty-two billion, one hundred ten million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •