Base | Representation |
---|---|
bin | 10001110010010000111… |
… | …011011110001001000001 |
3 | 11022211201101002210200102 |
4 | 101302100323132021001 |
5 | 130011032232033441 |
6 | 2333245535132145 |
7 | 154205211316460 |
oct | 21622073361101 |
9 | 4284641083612 |
10 | 1222202221121 |
11 | 431373322472 |
12 | 178a55074055 |
13 | 8b33a2c0c5b |
14 | 432250a89d7 |
15 | 21bd3e6169b |
hex | 11c90ede241 |
1222202221121 has 8 divisors (see below), whose sum is σ = 1399718622720. Its totient is φ = 1045414840608.
The previous prime is 1222202221109. The next prime is 1222202221147. The reversal of 1222202221121 is 1211222022221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1222202221121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1222202221093 and 1222202221102.
It is not an unprimeable number, because it can be changed into a prime (1222202221921) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 182251676 + ... + 182258381.
It is an arithmetic number, because the mean of its divisors is an integer number (174964827840).
Almost surely, 21222202221121 is an apocalyptic number.
It is an amenable number.
1222202221121 is a deficient number, since it is larger than the sum of its proper divisors (177516401599).
1222202221121 is an equidigital number, since it uses as much as digits as its factorization.
1222202221121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 364510543.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 1222202221121 its reverse (1211222022221), we get a palindrome (2433424243342).
The spelling of 1222202221121 in words is "one trillion, two hundred twenty-two billion, two hundred two million, two hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •