Base | Representation |
---|---|
bin | 101101011110100011101100… |
… | …111000010010110000101011 |
3 | 222020011221221221212020212211 |
4 | 231132203230320102300223 |
5 | 202203444044333020021 |
6 | 1545220125515345551 |
7 | 60062251044101614 |
oct | 5536435470226053 |
9 | 866157857766784 |
10 | 200012011220011 |
11 | 58803688038761 |
12 | 1a523801a522b7 |
13 | 877b089851663 |
14 | 37568c0d22c0b |
15 | 181cb887c93e1 |
hex | b5e8ece12c2b |
200012011220011 has 4 divisors (see below), whose sum is σ = 201239078773672. Its totient is φ = 198784943666352.
The previous prime is 200012011219981. The next prime is 200012011220027. The reversal of 200012011220011 is 110022110210002.
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 200012011220011 - 213 = 200012011211819 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200012011219973 and 200012011220000.
It is not an unprimeable number, because it can be changed into a prime (200012011220051) 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, 613533776586 + ... + 613533776911.
It is an arithmetic number, because the mean of its divisors is an integer number (50309769693418).
Almost surely, 2200012011220011 is an apocalyptic number.
200012011220011 is a deficient number, since it is larger than the sum of its proper divisors (1227067553661).
200012011220011 is a wasteful number, since it uses less digits than its factorization.
200012011220011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1227067553660.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200012011220011 its reverse (110022110210002), we get a palindrome (310034121430013).
The spelling of 200012011220011 in words is "two hundred trillion, twelve billion, eleven million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •