Base | Representation |
---|---|
bin | 101101111011110011110000… |
… | …001110101100110100111001 |
3 | 222111022010101100022222220101 |
4 | 231323303300032230310321 |
5 | 202434412241200320441 |
6 | 1553355402125555401 |
7 | 60360421160613226 |
oct | 5573636016546471 |
9 | 874263340288811 |
10 | 202022112120121 |
11 | 5940910764a277 |
12 | 1a7a92a4715b61 |
13 | 88957ac9705a7 |
14 | 37c5ccb0bc94d |
15 | 18550d3446231 |
hex | b7bcf03acd39 |
202022112120121 has 2 divisors, whose sum is σ = 202022112120122. Its totient is φ = 202022112120120.
The previous prime is 202022112120119. The next prime is 202022112120181. The reversal of 202022112120121 is 121021211220202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 166998630612025 + 35023481508096 = 12922795^2 + 5918064^2 .
It is a cyclic number.
It is not a de Polignac number, because 202022112120121 - 21 = 202022112120119 is a prime.
Together with 202022112120119, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (202022112120181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101011056060060 + 101011056060061.
It is an arithmetic number, because the mean of its divisors is an integer number (101011056060061).
Almost surely, 2202022112120121 is an apocalyptic number.
It is an amenable number.
202022112120121 is a deficient number, since it is larger than the sum of its proper divisors (1).
202022112120121 is an equidigital number, since it uses as much as digits as its factorization.
202022112120121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 202022112120121 its reverse (121021211220202), we get a palindrome (323043323340323).
The spelling of 202022112120121 in words is "two hundred two trillion, twenty-two billion, one hundred twelve million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •