Base | Representation |
---|---|
bin | 101101011110101101000001… |
… | …011101001000111110101011 |
3 | 222020012220210111100001002002 |
4 | 231132231001131020332223 |
5 | 202204130044121200021 |
6 | 1545224503020401215 |
7 | 60063054060140024 |
oct | 5536550135107653 |
9 | 866186714301062 |
10 | 200022020100011 |
11 | 5880795386840a |
12 | 1a5257359a620b |
13 | 877bcc332a965 |
14 | 3757190317c4b |
15 | 181d07233d50b |
hex | b5eb41748fab |
200022020100011 has 4 divisors (see below), whose sum is σ = 201461027439000. Its totient is φ = 198583012761024.
The previous prime is 200022020099981. The next prime is 200022020100029. The reversal of 200022020100011 is 110001020220002.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 200022020100011 - 210 = 200022020098987 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200022020099965 and 200022020100001.
It is not an unprimeable number, because it can be changed into a prime (200022020106011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 719503669286 + ... + 719503669563.
It is an arithmetic number, because the mean of its divisors is an integer number (50365256859750).
Almost surely, 2200022020100011 is an apocalyptic number.
200022020100011 is a deficient number, since it is larger than the sum of its proper divisors (1439007338989).
200022020100011 is a wasteful number, since it uses less digits than its factorization.
200022020100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1439007338988.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 200022020100011 its reverse (110001020220002), we get a palindrome (310023040320013).
The spelling of 200022020100011 in words is "two hundred trillion, twenty-two billion, twenty million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •