Base | Representation |
---|---|
bin | 10001110010010000111… |
… | …011000101011111001101 |
3 | 11022211201100220200011102 |
4 | 101302100323011133031 |
5 | 130011032220321031 |
6 | 2333245533032445 |
7 | 154205210416202 |
oct | 21622073053715 |
9 | 4284640820142 |
10 | 1222202120141 |
11 | 431373263612 |
12 | 178a55025725 |
13 | 8b33a286cc2 |
14 | 4322507dca9 |
15 | 21bd3e417cb |
hex | 11c90ec57cd |
1222202120141 has 2 divisors, whose sum is σ = 1222202120142. Its totient is φ = 1222202120140.
The previous prime is 1222202120119. The next prime is 1222202120149. The reversal of 1222202120141 is 1410212022221.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1166421600100 + 55780520041 = 1080010^2 + 236179^2 .
It is an emirp because it is prime and its reverse (1410212022221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1222202120141 - 26 = 1222202120077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1222202120149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 611101060070 + 611101060071.
It is an arithmetic number, because the mean of its divisors is an integer number (611101060071).
Almost surely, 21222202120141 is an apocalyptic number.
It is an amenable number.
1222202120141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1222202120141 is an equidigital number, since it uses as much as digits as its factorization.
1222202120141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 1222202120141 its reverse (1410212022221), we get a palindrome (2632414142362).
The spelling of 1222202120141 in words is "one trillion, two hundred twenty-two billion, two hundred two million, one hundred twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •