Base | Representation |
---|---|
bin | 110000000001101011000101… |
… | …010000111001000001101010 |
3 | 1000200212112212101020011000120 |
4 | 300001223011100321001222 |
5 | 210141122020033101442 |
6 | 2025121403533144110 |
7 | 62330141343046653 |
oct | 6001530520710152 |
9 | 1020775771204016 |
10 | 211221211222122 |
11 | 6133545a2335a2 |
12 | 1b83410432b036 |
13 | 90b20c83000ba |
14 | 3a2323837452a |
15 | 1964535e3e4ec |
hex | c01ac543906a |
211221211222122 has 16 divisors (see below), whose sum is σ = 422446376700192. Its totient is φ = 70406411364720.
The previous prime is 211221211222117. The next prime is 211221211222141. The reversal of 211221211222122 is 221222112122112.
It is a super-2 number, since 2×2112212112221222 (a number of 29 digits) contains 22 as substring.
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 211221211222092 and 211221211222101.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 164066029 + ... + 165348432.
It is an arithmetic number, because the mean of its divisors is an integer number (26402898543762).
Almost surely, 2211221211222122 is an apocalyptic number.
211221211222122 is an abundant number, since it is smaller than the sum of its proper divisors (211225165478070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211221211222122 is a wasteful number, since it uses less digits than its factorization.
211221211222122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 329521333.
The product of its digits is 512, while the sum is 24.
Adding to 211221211222122 its reverse (221222112122112), we get a palindrome (432443323344234).
The spelling of 211221211222122 in words is "two hundred eleven trillion, two hundred twenty-one billion, two hundred eleven million, two hundred twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •