Base | Representation |
---|---|
bin | 101101100001011101000111… |
… | …011111110010110111101001 |
3 | 222020212222211210120012020010 |
4 | 231201131013133302313221 |
5 | 202220224313101121301 |
6 | 1545451413135322133 |
7 | 60112526462012454 |
oct | 5541350737626751 |
9 | 866788753505203 |
10 | 200211100020201 |
11 | 58880061517a66 |
12 | 1a556304380349 |
13 | 8793a9715543a |
14 | 37623a9db049b |
15 | 1822e3bc5d5d6 |
hex | b617477f2de9 |
200211100020201 has 8 divisors (see below), whose sum is σ = 266951521471104. Its totient is φ = 133472372624720.
The previous prime is 200211100020143. The next prime is 200211100020233. The reversal of 200211100020201 is 102020001112002.
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 200211100020201 - 231 = 200208952536553 is a prime.
It is not an unprimeable number, because it can be changed into a prime (200211100020241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 423238065 + ... + 423710846.
It is an arithmetic number, because the mean of its divisors is an integer number (33368940183888).
Almost surely, 2200211100020201 is an apocalyptic number.
It is an amenable number.
200211100020201 is a deficient number, since it is larger than the sum of its proper divisors (66740421450903).
200211100020201 is an equidigital number, since it uses as much as digits as its factorization.
200211100020201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 847027711.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 200211100020201 its reverse (102020001112002), we get a palindrome (302231101132203).
The spelling of 200211100020201 in words is "two hundred trillion, two hundred eleven billion, one hundred million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •