Base | Representation |
---|---|
bin | 10001110010001011011… |
… | …111100100010001011001 |
3 | 11022211111000111022102121 |
4 | 101302023133210101121 |
5 | 130010340410120441 |
6 | 2333232520301241 |
7 | 154203023162365 |
oct | 21621337442131 |
9 | 4284430438377 |
10 | 1222111020121 |
11 | 4313268a0842 |
12 | 178a2a611821 |
13 | 8b32443b474 |
14 | 43216d282a5 |
15 | 21bcae48dd1 |
hex | 11c8b7e4459 |
1222111020121 has 4 divisors (see below), whose sum is σ = 1222219307392. Its totient is φ = 1222002732852.
The previous prime is 1222111020071. The next prime is 1222111020149. The reversal of 1222111020121 is 1210201112221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1222111020121 - 233 = 1213521085529 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1222111020095 and 1222111020104.
It is not an unprimeable number, because it can be changed into a prime (1222111020421) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 54126705 + ... + 54149278.
It is an arithmetic number, because the mean of its divisors is an integer number (305554826848).
Almost surely, 21222111020121 is an apocalyptic number.
It is an amenable number.
1222111020121 is a deficient number, since it is larger than the sum of its proper divisors (108287271).
1222111020121 is a wasteful number, since it uses less digits than its factorization.
1222111020121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 108287270.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 1222111020121 its reverse (1210201112221), we get a palindrome (2432312132342).
The spelling of 1222111020121 in words is "one trillion, two hundred twenty-two billion, one hundred eleven million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •