Base | Representation |
---|---|
bin | 1001101001010100100100… |
… | …01011111100011010011110 |
3 | 2210002202022010201000120000 |
4 | 10310222102023330122132 |
5 | 10240010112241042342 |
6 | 113040111022435130 |
7 | 4316305244442255 |
oct | 464522213743236 |
9 | 83082263630500 |
10 | 21211001112222 |
11 | 6838598181609 |
12 | 2466a01432aa6 |
13 | bab25bac53ac |
14 | 53489186579c |
15 | 26bb3078044c |
hex | 134a922fc69e |
21211001112222 has 40 divisors (see below), whose sum is σ = 48687582514032. Its totient is φ = 6897886538400.
The previous prime is 21211001112187. The next prime is 21211001112227. The reversal of 21211001112222 is 22221110011212.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 21211001112195 and 21211001112204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21211001112227) 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 19 ways as a sum of consecutive naturals, for example, 1596726354 + ... + 1596739637.
Almost surely, 221211001112222 is an apocalyptic number.
21211001112222 is an abundant number, since it is smaller than the sum of its proper divisors (27476581401810).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21211001112222 is a wasteful number, since it uses less digits than its factorization.
21211001112222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3193466046 (or 3193466037 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 21211001112222 its reverse (22221110011212), we get a palindrome (43432111123434).
The spelling of 21211001112222 in words is "twenty-one trillion, two hundred eleven billion, one million, one hundred twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •