Base | Representation |
---|---|
bin | 11110111000011110001… |
… | …111000110111001100001 |
3 | 21111212211020110002211202 |
4 | 132320132033012321201 |
5 | 234232302101333441 |
6 | 4302533535450545 |
7 | 306216421615163 |
oct | 36703617067141 |
9 | 7455736402752 |
10 | 2122221121121 |
11 | 7490355510a2 |
12 | 2a3373686a55 |
13 | 12518096689a |
14 | 74a04bb0933 |
15 | 3a30ce7319b |
hex | 1ee1e3c6e61 |
2122221121121 has 16 divisors (see below), whose sum is σ = 2224676686464. Its totient is φ = 2020617777024.
The previous prime is 2122221121109. The next prime is 2122221121171. The reversal of 2122221121121 is 1211211222212.
It is a cyclic number.
It is not a de Polignac number, because 2122221121121 - 26 = 2122221121057 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2122221121093 and 2122221121102.
It is not an unprimeable number, because it can be changed into a prime (2122221121171) 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 15 ways as a sum of consecutive naturals, for example, 29060165 + ... + 29133101.
It is an arithmetic number, because the mean of its divisors is an integer number (139042292904).
Almost surely, 22122221121121 is an apocalyptic number.
It is an amenable number.
2122221121121 is a deficient number, since it is larger than the sum of its proper divisors (102455565343).
2122221121121 is a wasteful number, since it uses less digits than its factorization.
2122221121121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78760.
The product of its digits is 128, while the sum is 20.
Adding to 2122221121121 its reverse (1211211222212), we get a palindrome (3333432343333).
The spelling of 2122221121121 in words is "two trillion, one hundred twenty-two billion, two hundred twenty-one million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •