Base | Representation |
---|---|
bin | 1011101001000011111… |
… | …1101100100010001001 |
3 | 201010020102101012011001 |
4 | 2322100333230202021 |
5 | 11234100241042301 |
6 | 231513525535001 |
7 | 20310133255402 |
oct | 2722077544211 |
9 | 633212335131 |
10 | 200001112201 |
11 | 77902460880 |
12 | 32917b74461 |
13 | 15b2461b497 |
14 | 99742d09a9 |
15 | 53085e3c01 |
hex | 2e90fec889 |
200001112201 has 8 divisors (see below), whose sum is σ = 220184712000. Its totient is φ = 180151125840.
The previous prime is 200001112193. The next prime is 200001112217. The reversal of 200001112201 is 102211100002.
200001112201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200001112201 - 23 = 200001112193 is a prime.
It is not an unprimeable number, because it can be changed into a prime (200001112231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 83402101 + ... + 83404498.
It is an arithmetic number, because the mean of its divisors is an integer number (27523089000).
Almost surely, 2200001112201 is an apocalyptic number.
It is an amenable number.
200001112201 is a deficient number, since it is larger than the sum of its proper divisors (20183599799).
200001112201 is a wasteful number, since it uses less digits than its factorization.
200001112201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166806719.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 200001112201 its reverse (102211100002), we get a palindrome (302212212203).
The spelling of 200001112201 in words is "two hundred billion, one million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •