Base | Representation |
---|---|
bin | 101101100001011100001100… |
… | …111110000101001100110011 |
3 | 222020212220022100220200020012 |
4 | 231201130030332011030303 |
5 | 202220220310213310414 |
6 | 1545451131501405135 |
7 | 60112463236606553 |
oct | 5541341476051463 |
9 | 866786270820205 |
10 | 200210118103859 |
11 | 5887a6a8225756 |
12 | 1a55608b5697ab |
13 | 879396b8aa356 |
14 | 376231580d163 |
15 | 1822dd095033e |
hex | b6170cf85333 |
200210118103859 has 2 divisors, whose sum is σ = 200210118103860. Its totient is φ = 200210118103858.
The previous prime is 200210118103841. The next prime is 200210118103861. The reversal of 200210118103859 is 958301811012002.
200210118103859 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200210118103859 - 240 = 199110606476083 is a prime.
It is a super-2 number, since 2×2002101181038592 (a number of 29 digits) contains 22 as substring.
Together with 200210118103861, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (200210118103819) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105059051929 + 100105059051930.
It is an arithmetic number, because the mean of its divisors is an integer number (100105059051930).
Almost surely, 2200210118103859 is an apocalyptic number.
200210118103859 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210118103859 is an equidigital number, since it uses as much as digits as its factorization.
200210118103859 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 34560, while the sum is 41.
The spelling of 200210118103859 in words is "two hundred trillion, two hundred ten billion, one hundred eighteen million, one hundred three thousand, eight hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •