Base | Representation |
---|---|
bin | 101101011110101101000000… |
… | …111110010100010100101011 |
3 | 222020012220202221010112101211 |
4 | 231132231000332110110223 |
5 | 202204130040034120021 |
6 | 1545224502131253551 |
7 | 60063053631355126 |
oct | 5536550076242453 |
9 | 866186687115354 |
10 | 200022012020011 |
11 | 5880794a249825 |
12 | 1a52573314a2b7 |
13 | 877bcc175bcac |
14 | 375718d2133bd |
15 | 181d0717943e1 |
hex | b5eb40f9452b |
200022012020011 has 8 divisors (see below), whose sum is σ = 200920154839040. Its totient is φ = 199123879765032.
The previous prime is 200022012019927. The next prime is 200022012020021. The reversal of 200022012020011 is 110020210220002.
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 a de Polignac number, because none of the positive numbers 2k-200022012020011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200022012019973 and 200022012020000.
It is not an unprimeable number, because it can be changed into a prime (200022012020021) 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, 36619780 + ... + 41725918.
It is an arithmetic number, because the mean of its divisors is an integer number (25115019354880).
Almost surely, 2200022012020011 is an apocalyptic number.
200022012020011 is a deficient number, since it is larger than the sum of its proper divisors (898142819029).
200022012020011 is a wasteful number, since it uses less digits than its factorization.
200022012020011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5282025.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 200022012020011 its reverse (110020210220002), we get a palindrome (310042222240013).
The spelling of 200022012020011 in words is "two hundred trillion, twenty-two billion, twelve million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •