Base | Representation |
---|---|
bin | 101101100001011100010001… |
… | …111110001010000110010001 |
3 | 222020212220112012210112211002 |
4 | 231201130101332022012101 |
5 | 202220220443203310001 |
6 | 1545451144100031345 |
7 | 60112465306032101 |
oct | 5541342176120621 |
9 | 866786465715732 |
10 | 200210202010001 |
11 | 5887a740624677 |
12 | 1a5560b3692555 |
13 | 87939830a7661 |
14 | 3762322a11201 |
15 | 1822dd7ec646b |
hex | b61711f8a191 |
200210202010001 has 4 divisors (see below), whose sum is σ = 200276961000000. Its totient is φ = 200143443020004.
The previous prime is 200210202009991. The next prime is 200210202010057. The reversal of 200210202010001 is 100010202012002.
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-200210202010001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200210202019001) 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, 33379490501 + ... + 33379496498.
It is an arithmetic number, because the mean of its divisors is an integer number (50069240250000).
Almost surely, 2200210202010001 is an apocalyptic number.
It is an amenable number.
200210202010001 is a deficient number, since it is larger than the sum of its proper divisors (66758989999).
200210202010001 is an equidigital number, since it uses as much as digits as its factorization.
200210202010001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66758989998.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 200210202010001 its reverse (100010202012002), we get a palindrome (300220404022003).
The spelling of 200210202010001 in words is "two hundred trillion, two hundred ten billion, two hundred two million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •