Base | Representation |
---|---|
bin | 101101100001100101011011… |
… | …001110101101111000000011 |
3 | 222020220211212112000001100222 |
4 | 231201211123032231320003 |
5 | 202220401100340202321 |
6 | 1545455450255333255 |
7 | 60113263525202621 |
oct | 5541453316557003 |
9 | 866824775001328 |
10 | 200220021022211 |
11 | 5888391a1618a3 |
12 | 1a557b93b2122b |
13 | 8794889436458 |
14 | 37629b4b00511 |
15 | 18232b00333ab |
hex | b6195b3ade03 |
200220021022211 has 2 divisors, whose sum is σ = 200220021022212. Its totient is φ = 200220021022210.
The previous prime is 200220021022141. The next prime is 200220021022223. The reversal of 200220021022211 is 112220120022002.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200220021022211 - 222 = 200220016827907 is a prime.
It is a super-2 number, since 2×2002200210222112 (a number of 29 digits) contains 22 as substring.
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 200220021022211.
It is not a weakly prime, because it can be changed into another prime (200220021022711) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100110010511105 + 100110010511106.
It is an arithmetic number, because the mean of its divisors is an integer number (100110010511106).
Almost surely, 2200220021022211 is an apocalyptic number.
200220021022211 is a deficient number, since it is larger than the sum of its proper divisors (1).
200220021022211 is an equidigital number, since it uses as much as digits as its factorization.
200220021022211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 200220021022211 its reverse (112220120022002), we get a palindrome (312440141044213).
The spelling of 200220021022211 in words is "two hundred trillion, two hundred twenty billion, twenty-one million, twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •