Base | Representation |
---|---|
bin | 101101100000000000110101… |
… | …011001110001000011100011 |
3 | 222020112112002012100111110022 |
4 | 231200000311121301003203 |
5 | 202212113400110432321 |
6 | 1545334104515424055 |
7 | 60102421132320644 |
oct | 5540006531610343 |
9 | 866475065314408 |
10 | 200112012202211 |
11 | 58842033a8479a |
12 | 1a53b06bbb502b |
13 | 8787635616185 |
14 | 375b68a15b6cb |
15 | 182058cb59dab |
hex | b600356710e3 |
200112012202211 has 4 divisors (see below), whose sum is σ = 200112975788400. Its totient is φ = 200111048616024.
The previous prime is 200112012202183. The next prime is 200112012202217. The reversal of 200112012202211 is 112202210211002.
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 200112012202211 - 26 = 200112012202147 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 200112012202211.
It is not an unprimeable number, because it can be changed into a prime (200112012202217) 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, 481481516 + ... + 481896953.
It is an arithmetic number, because the mean of its divisors is an integer number (50028243947100).
Almost surely, 2200112012202211 is an apocalyptic number.
200112012202211 is a deficient number, since it is larger than the sum of its proper divisors (963586189).
200112012202211 is an equidigital number, since it uses as much as digits as its factorization.
200112012202211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 963586188.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 200112012202211 its reverse (112202210211002), we get a palindrome (312314222413213).
The spelling of 200112012202211 in words is "two hundred trillion, one hundred twelve billion, twelve million, two hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •