Base | Representation |
---|---|
bin | 101101100001011100010010… |
… | …100000011111111001110011 |
3 | 222020212220112211201220112021 |
4 | 231201130102200133321303 |
5 | 202220221003004342321 |
6 | 1545451145021012311 |
7 | 60112465445404441 |
oct | 5541342240377163 |
9 | 866786484656467 |
10 | 200210211012211 |
11 | 5887a745713114 |
12 | 1a5560b66b4097 |
13 | 8793984c09cca |
14 | 3762323cb5b91 |
15 | 1822dd8ba3941 |
hex | b6171281fe73 |
200210211012211 has 8 divisors (see below), whose sum is σ = 203226095940800. Its totient is φ = 197206365545280.
The previous prime is 200210211012143. The next prime is 200210211012281. The reversal of 200210211012211 is 112210112012002.
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 200210211012211 - 217 = 200210210881139 is a prime.
It is a super-2 number, since 2×2002102110122112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200210211012281) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3009831906 + ... + 3009898423.
It is an arithmetic number, because the mean of its divisors is an integer number (25403261992600).
Almost surely, 2200210211012211 is an apocalyptic number.
200210211012211 is a deficient number, since it is larger than the sum of its proper divisors (3015884928589).
200210211012211 is an equidigital number, since it uses as much as digits as its factorization.
200210211012211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6019730829.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 200210211012211 its reverse (112210112012002), we get a palindrome (312420323024213).
The spelling of 200210211012211 in words is "two hundred trillion, two hundred ten billion, two hundred eleven million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •