Base | Representation |
---|---|
bin | 1010000000010100000100… |
… | …11101010001000011010011 |
3 | 2212220021110022001122112111 |
4 | 11000022002131101003103 |
5 | 10340431032331401321 |
6 | 114443043000410151 |
7 | 4430343365416351 |
oct | 500120235210323 |
9 | 85807408048474 |
10 | 22001011200211 |
11 | 701263829157a |
12 | 2573b3a176957 |
13 | c378c01a7214 |
14 | 560bd71327d1 |
15 | 28246ba085e1 |
hex | 1402827510d3 |
22001011200211 has 8 divisors (see below), whose sum is σ = 22961506118400. Its totient is φ = 21040843716552.
The previous prime is 22001011200209. The next prime is 22001011200239. The reversal of 22001011200211 is 11200211010022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22001011200211 - 21 = 22001011200209 is a prime.
It is a super-4 number, since 4×220010112002114 (a number of 54 digits) contains 4444 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22001011200191 and 22001011200200.
It is not an unprimeable number, because it can be changed into a prime (22001011200251) 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, 81721311 + ... + 81990088.
It is an arithmetic number, because the mean of its divisors is an integer number (2870188264800).
Almost surely, 222001011200211 is an apocalyptic number.
22001011200211 is a deficient number, since it is larger than the sum of its proper divisors (960494918189).
22001011200211 is a wasteful number, since it uses less digits than its factorization.
22001011200211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163717265.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 22001011200211 its reverse (11200211010022), we get a palindrome (33201222210233).
The spelling of 22001011200211 in words is "twenty-two trillion, one billion, eleven million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •