Base | Representation |
---|---|
bin | 10111110111011… |
… | …11101010101001 |
3 | 111221201210000102 |
4 | 23323233222221 |
5 | 402223223423 |
6 | 31511115145 |
7 | 4650523604 |
oct | 1373575251 |
9 | 457653012 |
10 | 200211113 |
11 | a3017633 |
12 | 57072ab5 |
13 | 3262c41b |
14 | 1c83933b |
15 | 1289bc28 |
hex | beefaa9 |
200211113 has 16 divisors (see below), whose sum is σ = 227020800. Its totient is φ = 175562640.
The previous prime is 200211103. The next prime is 200211127. The reversal of 200211113 is 311112002.
It is a cyclic number.
It is not a de Polignac number, because 200211113 - 222 = 196016809 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200211094 and 200211103.
It is not an unprimeable number, because it can be changed into a prime (200211103) 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 15 ways as a sum of consecutive naturals, for example, 6158 + ... + 20936.
It is an arithmetic number, because the mean of its divisors is an integer number (14188800).
Almost surely, 2200211113 is an apocalyptic number.
200211113 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
200211113 is a deficient number, since it is larger than the sum of its proper divisors (26809687).
200211113 is a wasteful number, since it uses less digits than its factorization.
200211113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14852.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 200211113 is about 14149.5976267878. The cubic root of 200211113 is about 585.0092413374.
Adding to 200211113 its reverse (311112002), we get a palindrome (511323115).
The spelling of 200211113 in words is "two hundred million, two hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •