Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100011000110000100110001 |
3 | 222020212222120211202220211111 |
4 | 231201131001203012010301 |
5 | 202220224112024101001 |
6 | 1545451355212313321 |
7 | 60112524140520556 |
oct | 5541350143060461 |
9 | 866788524686744 |
10 | 200211000222001 |
11 | 5888001015410a |
12 | 1a556296a72841 |
13 | 8793a7c582752 |
14 | 376239aa32a2d |
15 | 1822e330e8851 |
hex | b617418c6131 |
200211000222001 has 4 divisors (see below), whose sum is σ = 200242664153712. Its totient is φ = 200179336290292.
The previous prime is 200211000221977. The next prime is 200211000222029. The reversal of 200211000222001 is 100222000112002.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200211000222001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200211000222041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15831956371 + ... + 15831969016.
It is an arithmetic number, because the mean of its divisors is an integer number (50060666038428).
Almost surely, 2200211000222001 is an apocalyptic number.
It is an amenable number.
200211000222001 is a deficient number, since it is larger than the sum of its proper divisors (31663931711).
200211000222001 is an equidigital number, since it uses as much as digits as its factorization.
200211000222001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31663931710.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 200211000222001 its reverse (100222000112002), we get a palindrome (300433000334003).
The spelling of 200211000222001 in words is "two hundred trillion, two hundred eleven billion, two hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •