Base | Representation |
---|---|
bin | 11110110111011100101… |
… | …110011000001101000011 |
3 | 21111202222122022002120201 |
4 | 132313130232120031003 |
5 | 234223024214202321 |
6 | 4302232514150031 |
7 | 306150244464163 |
oct | 36673456301503 |
9 | 7452878262521 |
10 | 2121122022211 |
11 | 7486210a1895 |
12 | 2a3107582317 |
13 | 1250370400ba |
14 | 7493cc285a3 |
15 | 3a296719291 |
hex | 1eddcb98343 |
2121122022211 has 8 divisors (see below), whose sum is σ = 2252518963920. Its totient is φ = 1991700974592.
The previous prime is 2121122022179. The next prime is 2121122022221. The reversal of 2121122022211 is 1122202211212.
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 2121122022211 - 25 = 2121122022179 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is not an unprimeable number, because it can be changed into a prime (2121122022221) 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 7 ways as a sum of consecutive naturals, for example, 493971310 + ... + 493975603.
It is an arithmetic number, because the mean of its divisors is an integer number (281564870490).
Almost surely, 22121122022211 is an apocalyptic number.
2121122022211 is a deficient number, since it is larger than the sum of its proper divisors (131396941709).
2121122022211 is a wasteful number, since it uses less digits than its factorization.
2121122022211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 987947045.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 2121122022211 its reverse (1122202211212), we get a palindrome (3243324233423).
The spelling of 2121122022211 in words is "two trillion, one hundred twenty-one billion, one hundred twenty-two million, twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •