Base | Representation |
---|---|
bin | 101101111110011011010011… |
… | …000111000111111010100011 |
3 | 222111221022201220010000102222 |
4 | 231332123103013013322203 |
5 | 203000334210112033331 |
6 | 1554014153321301255 |
7 | 60406420234341431 |
oct | 5576332307077243 |
9 | 874838656100388 |
10 | 202202012221091 |
11 | 59478434559873 |
12 | 1a81813093482b |
13 | 88a974c9a828c |
14 | 37d08b5911d51 |
15 | 1859b11eb9b7b |
hex | b7e6d31c7ea3 |
202202012221091 has 2 divisors, whose sum is σ = 202202012221092. Its totient is φ = 202202012221090.
The previous prime is 202202012221067. The next prime is 202202012221129. The reversal of 202202012221091 is 190122210202202.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 202202012221091 - 214 = 202202012204707 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 202202012221091.
It is not a weakly prime, because it can be changed into another prime (202202012221591) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101101006110545 + 101101006110546.
It is an arithmetic number, because the mean of its divisors is an integer number (101101006110546).
Almost surely, 2202202012221091 is an apocalyptic number.
202202012221091 is a deficient number, since it is larger than the sum of its proper divisors (1).
202202012221091 is an equidigital number, since it uses as much as digits as its factorization.
202202012221091 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 202202012221091 its reverse (190122210202202), we get a palindrome (392324222423293).
The spelling of 202202012221091 in words is "two hundred two trillion, two hundred two billion, twelve million, two hundred twenty-one thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •