Base | Representation |
---|---|
bin | 101101011111111111111111… |
… | …001010011011000010011001 |
3 | 222020112102201210001010002112 |
4 | 231133333333022123002121 |
5 | 202212110014131211301 |
6 | 1545333434331242105 |
7 | 60102356442445010 |
oct | 5537777712330231 |
9 | 866472653033075 |
10 | 200111102210201 |
11 | 58841707348286 |
12 | 1a53aa572a9335 |
13 | 878751bc31770 |
14 | 375b60135da77 |
15 | 1820537d079bb |
hex | b5ffff29b099 |
200111102210201 has 8 divisors (see below), whose sum is σ = 246290587335744. Its totient is φ = 158329663287120.
The previous prime is 200111102210183. The next prime is 200111102210249. The reversal of 200111102210201 is 102012201111002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200111102210201 - 222 = 200111098015897 is a prime.
It is not an unprimeable number, because it can be changed into a prime (200111102210291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1099511550515 + ... + 1099511550696.
It is an arithmetic number, because the mean of its divisors is an integer number (30786323416968).
Almost surely, 2200111102210201 is an apocalyptic number.
It is an amenable number.
200111102210201 is a deficient number, since it is larger than the sum of its proper divisors (46179485125543).
200111102210201 is a wasteful number, since it uses less digits than its factorization.
200111102210201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2199023101231.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 200111102210201 its reverse (102012201111002), we get a palindrome (302123303321203).
The spelling of 200111102210201 in words is "two hundred trillion, one hundred eleven billion, one hundred two million, two hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •