Base | Representation |
---|---|
bin | 101101111110011010100011… |
… | …111100111011101010000011 |
3 | 222111221020200202022211222122 |
4 | 231332122203330323222003 |
5 | 203000331100040122131 |
6 | 1554013543015154455 |
7 | 60406361516263523 |
oct | 5576324374735203 |
9 | 874836622284878 |
10 | 202201221020291 |
11 | 59478068988a09 |
12 | 1a817b4b975a2b |
13 | 88a9654ab651c |
14 | 37d083c7d7683 |
15 | 1859ab77ced7b |
hex | b7e6a3f3ba83 |
202201221020291 has 2 divisors, whose sum is σ = 202201221020292. Its totient is φ = 202201221020290.
The previous prime is 202201221020153. The next prime is 202201221020333. The reversal of 202201221020291 is 192020122102202.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 202201221020291 - 210 = 202201221019267 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 202201221020291.
It is not a weakly prime, because it can be changed into another prime (202201221020791) 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, 101100610510145 + 101100610510146.
It is an arithmetic number, because the mean of its divisors is an integer number (101100610510146).
Almost surely, 2202201221020291 is an apocalyptic number.
202201221020291 is a deficient number, since it is larger than the sum of its proper divisors (1).
202201221020291 is an equidigital number, since it uses as much as digits as its factorization.
202201221020291 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 202201221020291 its reverse (192020122102202), we get a palindrome (394221343122493).
The spelling of 202201221020291 in words is "two hundred two trillion, two hundred one billion, two hundred twenty-one million, twenty thousand, two hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •