Base | Representation |
---|---|
bin | 100000001100001101010… |
… | …010111011001001101001 |
3 | 21211110220020011110201111 |
4 | 200030031102323021221 |
5 | 242220421043101441 |
6 | 4412123345150321 |
7 | 315551450066422 |
oct | 40141522731151 |
9 | 7743806143644 |
10 | 2212131222121 |
11 | 78318344a797 |
12 | 2b888632b3a1 |
13 | 1307abc70b92 |
14 | 790d3b8a649 |
15 | 3c821493081 |
hex | 2030d4bb269 |
2212131222121 has 16 divisors (see below), whose sum is σ = 2344165611840. Its totient is φ = 2081679687360.
The previous prime is 2212131222071. The next prime is 2212131222137. The reversal of 2212131222121 is 1212221312122.
It is a cyclic number.
It is not a de Polignac number, because 2212131222121 - 211 = 2212131220073 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2212131222092 and 2212131222101.
It is not an unprimeable number, because it can be changed into a prime (2212131222181) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3284826 + ... + 3900556.
It is an arithmetic number, because the mean of its divisors is an integer number (146510350740).
Almost surely, 22212131222121 is an apocalyptic number.
It is an amenable number.
2212131222121 is a deficient number, since it is larger than the sum of its proper divisors (132034389719).
2212131222121 is a wasteful number, since it uses less digits than its factorization.
2212131222121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 617016.
The product of its digits is 384, while the sum is 22.
Adding to 2212131222121 its reverse (1212221312122), we get a palindrome (3424352534243).
Subtracting from 2212131222121 its reverse (1212221312122), we obtain a palindrome (999909909999).
The spelling of 2212131222121 in words is "two trillion, two hundred twelve billion, one hundred thirty-one million, two hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •