Base | Representation |
---|---|
bin | 101101100001011100010010… |
… | …011101011110011111100001 |
3 | 222020212220112210020122211011 |
4 | 231201130102131132133201 |
5 | 202220221002304020001 |
6 | 1545451144552020521 |
7 | 60112465435565002 |
oct | 5541342235363741 |
9 | 866786483218734 |
10 | 200210210220001 |
11 | 5887a7452219a3 |
12 | 1a5560b6391741 |
13 | 87939849c0547 |
14 | 3762323b4b1a9 |
15 | 1822dd8a98d51 |
hex | b6171275e7e1 |
200210210220001 has 4 divisors (see below), whose sum is σ = 200210373237952. Its totient is φ = 200210047202052.
The previous prime is 200210210219983. The next prime is 200210210220037. The reversal of 200210210220001 is 100022012012002.
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 not a de Polignac number, because 200210210220001 - 227 = 200210076002273 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200210210220061) 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, 79652661 + ... + 82127746.
It is an arithmetic number, because the mean of its divisors is an integer number (50052593309488).
Almost surely, 2200210210220001 is an apocalyptic number.
It is an amenable number.
200210210220001 is a deficient number, since it is larger than the sum of its proper divisors (163017951).
200210210220001 is a wasteful number, since it uses less digits than its factorization.
200210210220001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163017950.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 200210210220001 its reverse (100022012012002), we get a palindrome (300232222232003).
The spelling of 200210210220001 in words is "two hundred trillion, two hundred ten billion, two hundred ten million, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •