Base | Representation |
---|---|
bin | 10111110110101… |
… | …10100010111101 |
3 | 111221112112212121 |
4 | 23323112202331 |
5 | 402211430341 |
6 | 31505002541 |
7 | 4646614615 |
oct | 1373264275 |
9 | 457475777 |
10 | 200108221 |
11 | a2a572a5 |
12 | 57023451 |
13 | 325c4641 |
14 | 1c80da45 |
15 | 1287b4d1 |
hex | bed68bd |
200108221 has 2 divisors, whose sum is σ = 200108222. Its totient is φ = 200108220.
The previous prime is 200108219. The next prime is 200108239. The reversal of 200108221 is 122801002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 133864900 + 66243321 = 11570^2 + 8139^2 .
It is a cyclic number.
It is not a de Polignac number, because 200108221 - 21 = 200108219 is a prime.
It is a super-2 number, since 2×2001082212 = 80086600223569682, which contains 22 as substring.
Together with 200108219, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 200108195 and 200108204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200108201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100054110 + 100054111.
It is an arithmetic number, because the mean of its divisors is an integer number (100054111).
Almost surely, 2200108221 is an apocalyptic number.
It is an amenable number.
200108221 is a deficient number, since it is larger than the sum of its proper divisors (1).
200108221 is an equidigital number, since it uses as much as digits as its factorization.
200108221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 16.
The square root of 200108221 is about 14145.9612964266. The cubic root of 200108221 is about 584.9090086642.
Adding to 200108221 its reverse (122801002), we get a palindrome (322909223).
The spelling of 200108221 in words is "two hundred million, one hundred eight thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •