Base | Representation |
---|---|
bin | 110010000100010110001010… |
… | …011101001010101001010011 |
3 | 1001212200000021101022111012212 |
4 | 302010112022131022221103 |
5 | 212330233122301401321 |
6 | 2100154535440542335 |
7 | 64244666041343453 |
oct | 6204261235125123 |
9 | 1055600241274185 |
10 | 220201001200211 |
11 | 641877a1605079 |
12 | 208445199219ab |
13 | 95b3b3312c335 |
14 | 3c53adcd03d63 |
15 | 1a6ce0021655b |
hex | c8458a74aa53 |
220201001200211 has 4 divisors (see below), whose sum is σ = 220298134418712. Its totient is φ = 220103867981712.
The previous prime is 220201001200181. The next prime is 220201001200237. The reversal of 220201001200211 is 112002100102022.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 220201001200211 - 210 = 220201001199187 is a prime.
It is a super-4 number, since 4×2202010012002114 (a number of 58 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (220201501200211) 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, 48566605850 + ... + 48566610383.
It is an arithmetic number, because the mean of its divisors is an integer number (55074533604678).
Almost surely, 2220201001200211 is an apocalyptic number.
220201001200211 is a deficient number, since it is larger than the sum of its proper divisors (97133218501).
220201001200211 is an equidigital number, since it uses as much as digits as its factorization.
220201001200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97133218500.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 220201001200211 its reverse (112002100102022), we get a palindrome (332203101302233).
The spelling of 220201001200211 in words is "two hundred twenty trillion, two hundred one billion, one million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •