Base | Representation |
---|---|
bin | 1011110000111101001… |
… | …1011100110101101011 |
3 | 201022201002212000120111 |
4 | 2330033103130311223 |
5 | 11302420234020021 |
6 | 232504105435151 |
7 | 20413504344313 |
oct | 2741723346553 |
9 | 638632760514 |
10 | 202120220011 |
11 | 7879a65a946 |
12 | 3320979bab7 |
13 | 160a1669628 |
14 | 9ad5912443 |
15 | 53ce6828e1 |
hex | 2f0f4dcd6b |
202120220011 has 8 divisors (see below), whose sum is σ = 213538605120. Its totient is φ = 190998416448.
The previous prime is 202120220009. The next prime is 202120220041. The reversal of 202120220011 is 110022021202.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 202120220011 - 21 = 202120220009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202120219973 and 202120220000.
It is not an unprimeable number, because it can be changed into a prime (202120220041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 74143986 + ... + 74146711.
It is an arithmetic number, because the mean of its divisors is an integer number (26692325640).
Almost surely, 2202120220011 is an apocalyptic number.
202120220011 is a deficient number, since it is larger than the sum of its proper divisors (11418385109).
202120220011 is a wasteful number, since it uses less digits than its factorization.
202120220011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148290773.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 202120220011 its reverse (110022021202), we get a palindrome (312142241213).
The spelling of 202120220011 in words is "two hundred two billion, one hundred twenty million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •