Base | Representation |
---|---|
bin | 10111110110101… |
… | …10100010110011 |
3 | 111221112112212020 |
4 | 23323112202303 |
5 | 402211430321 |
6 | 31505002523 |
7 | 4646614602 |
oct | 1373264263 |
9 | 457475766 |
10 | 200108211 |
11 | a2a57296 |
12 | 57023443 |
13 | 325c4634 |
14 | 1c80da39 |
15 | 1287b4c6 |
hex | bed68b3 |
200108211 has 8 divisors (see below), whose sum is σ = 278411520. Its totient is φ = 127605192.
The previous prime is 200108203. The next prime is 200108219. The reversal of 200108211 is 112801002.
It is an interprime number because it is at equal distance from previous prime (200108203) and next prime (200108219).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200108211 - 23 = 200108203 is a prime.
It is a super-2 number, since 2×2001082112 = 80086592219241042, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (200108219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1449991 + ... + 1450128.
It is an arithmetic number, because the mean of its divisors is an integer number (34801440).
Almost surely, 2200108211 is an apocalyptic number.
200108211 is a deficient number, since it is larger than the sum of its proper divisors (78303309).
200108211 is a wasteful number, since it uses less digits than its factorization.
200108211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2900145.
The product of its (nonzero) digits is 32, while the sum is 15.
The square root of 200108211 is about 14145.9609429688. The cubic root of 200108211 is about 584.9089989210.
Adding to 200108211 its reverse (112801002), we get a palindrome (312909213).
The spelling of 200108211 in words is "two hundred million, one hundred eight thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •