Base | Representation |
---|---|
bin | 1011101101100001110… |
… | …1111001000010111111 |
3 | 201020022222200200020202 |
4 | 2323120131321002333 |
5 | 11244024223210421 |
6 | 232232522434115 |
7 | 20351633365565 |
oct | 2733035710277 |
9 | 636288620222 |
10 | 201200210111 |
11 | 7836830088a |
12 | 32bb166293b |
13 | 15c85b88184 |
14 | 9a49667a35 |
15 | 5378a0210b |
hex | 2ed87790bf |
201200210111 has 8 divisors (see below), whose sum is σ = 203783126400. Its totient is φ = 198621075352.
The previous prime is 201200210093. The next prime is 201200210147. The reversal of 201200210111 is 111012002102.
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 201200210111 - 222 = 201196015807 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201200210092 and 201200210101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201200210311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 838211 + ... + 1051188.
It is an arithmetic number, because the mean of its divisors is an integer number (25472890800).
Almost surely, 2201200210111 is an apocalyptic number.
201200210111 is a deficient number, since it is larger than the sum of its proper divisors (2582916289).
201200210111 is a wasteful number, since it uses less digits than its factorization.
201200210111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1890765.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 201200210111 its reverse (111012002102), we get a palindrome (312212212213).
The spelling of 201200210111 in words is "two hundred one billion, two hundred million, two hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •