Base | Representation |
---|---|
bin | 101101111110011011011111… |
… | …100100010100101001011011 |
3 | 222111221100021110100100101001 |
4 | 231332123133210110221123 |
5 | 203000340122111431021 |
6 | 1554014230144405431 |
7 | 60406425352552312 |
oct | 5576333744245133 |
9 | 874840243310331 |
10 | 202202221202011 |
11 | 59478531516278 |
12 | 1a81818a916877 |
13 | 88a9784088324 |
14 | 37d08d5591279 |
15 | 1859b254ea091 |
hex | b7e6df914a5b |
202202221202011 has 2 divisors, whose sum is σ = 202202221202012. Its totient is φ = 202202221202010.
The previous prime is 202202221201933. The next prime is 202202221202027. The reversal of 202202221202011 is 110202122202202.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 202202221202011 - 29 = 202202221201499 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 202202221202011.
It is not a weakly prime, because it can be changed into another prime (202202221208011) 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, 101101110601005 + 101101110601006.
It is an arithmetic number, because the mean of its divisors is an integer number (101101110601006).
Almost surely, 2202202221202011 is an apocalyptic number.
202202221202011 is a deficient number, since it is larger than the sum of its proper divisors (1).
202202221202011 is an equidigital number, since it uses as much as digits as its factorization.
202202221202011 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 19.
Adding to 202202221202011 its reverse (110202122202202), we get a palindrome (312404343404213).
The spelling of 202202221202011 in words is "two hundred two trillion, two hundred two billion, two hundred twenty-one million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.177 sec. • engine limits •