Base | Representation |
---|---|
bin | 1001001001010010001011… |
… | …11111101011010011010011 |
3 | 2122012111222012021120020212 |
4 | 10210221011333223103103 |
5 | 10113441203031401321 |
6 | 110434300430354335 |
7 | 4143625531535246 |
oct | 444510577532323 |
9 | 78174865246225 |
10 | 20110211200211 |
11 | 6453768a4aa80 |
12 | 23095b105b9ab |
13 | b2b500489b82 |
14 | 4d74a74db25d |
15 | 24d1a579b55b |
hex | 124a45feb4d3 |
20110211200211 has 4 divisors (see below), whose sum is σ = 21938412218424. Its totient is φ = 18282010182000.
The previous prime is 20110211200159. The next prime is 20110211200217. The reversal of 20110211200211 is 11200211201102.
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 20110211200211 - 26 = 20110211200147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20110211200217) 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, 914100509090 + ... + 914100509111.
It is an arithmetic number, because the mean of its divisors is an integer number (5484603054606).
Almost surely, 220110211200211 is an apocalyptic number.
20110211200211 is a deficient number, since it is larger than the sum of its proper divisors (1828201018213).
20110211200211 is a wasteful number, since it uses less digits than its factorization.
20110211200211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1828201018212.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 20110211200211 its reverse (11200211201102), we get a palindrome (31310422401313).
It can be divided in two parts, 201102 and 11200211, that multiplied together give a palindrome (2252384832522).
The spelling of 20110211200211 in words is "twenty trillion, one hundred ten billion, two hundred eleven million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •