Base | Representation |
---|---|
bin | 101101100000000001000000… |
… | …101010000000111101000011 |
3 | 222020112112120100121222102211 |
4 | 231200001000222000331003 |
5 | 202212114241424323021 |
6 | 1545334135342322551 |
7 | 60102425614214632 |
oct | 5540010052007503 |
9 | 866475510558384 |
10 | 200112201011011 |
11 | 58842120613623 |
12 | 1a53b103289457 |
13 | 8787665782663 |
14 | 375b6a7269519 |
15 | 182059e5033e1 |
hex | b60040a80f43 |
200112201011011 has 4 divisors (see below), whose sum is σ = 200112991899552. Its totient is φ = 200111410122472.
The previous prime is 200112201010937. The next prime is 200112201011039. The reversal of 200112201011011 is 110110102211002.
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 200112201011011 - 29 = 200112201010499 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200112201010982 and 200112201011000.
It is not an unprimeable number, because it can be changed into a prime (200112201011071) 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, 395064616 + ... + 395570821.
It is an arithmetic number, because the mean of its divisors is an integer number (50028247974888).
Almost surely, 2200112201011011 is an apocalyptic number.
200112201011011 is a deficient number, since it is larger than the sum of its proper divisors (790888541).
200112201011011 is an equidigital number, since it uses as much as digits as its factorization.
200112201011011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 790888540.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 200112201011011 its reverse (110110102211002), we get a palindrome (310222303222013).
The spelling of 200112201011011 in words is "two hundred trillion, one hundred twelve billion, two hundred one million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.626 sec. • engine limits •