Base | Representation |
---|---|
bin | 101101100001100101011011… |
… | …001110101000111100011011 |
3 | 222020220211212111222000122211 |
4 | 231201211123032220330123 |
5 | 202220401100334031021 |
6 | 1545455450255055551 |
7 | 60113263525060003 |
oct | 5541453316507433 |
9 | 866824774860584 |
10 | 200220021002011 |
11 | 5888391a1486aa |
12 | 1a557b93b115b7 |
13 | 879488942a1ba |
14 | 37629b4ad7003 |
15 | 18232b002c3e1 |
hex | b6195b3a8f1b |
200220021002011 has 8 divisors (see below), whose sum is σ = 200297132459424. Its totient is φ = 200142915157440.
The previous prime is 200220021001969. The next prime is 200220021002081. The reversal of 200220021002011 is 110200120022002.
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 200220021002011 - 229 = 200219484131099 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200220021001982 and 200220021002000.
It is not an unprimeable number, because it can be changed into a prime (200220021002081) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 70666015 + ... + 73444711.
It is an arithmetic number, because the mean of its divisors is an integer number (25037141557428).
Almost surely, 2200220021002011 is an apocalyptic number.
200220021002011 is a deficient number, since it is larger than the sum of its proper divisors (77111457413).
200220021002011 is a wasteful number, since it uses less digits than its factorization.
200220021002011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2806421.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 200220021002011 its reverse (110200120022002), we get a palindrome (310420141024013).
The spelling of 200220021002011 in words is "two hundred trillion, two hundred twenty billion, twenty-one million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •