Base | Representation |
---|---|
bin | 1001001001010011110101… |
… | …11110101001001110011011 |
3 | 2122012121021010221110201111 |
4 | 10210221322332221032123 |
5 | 10114000013112401021 |
6 | 110434524543201151 |
7 | 4143656544334063 |
oct | 444517276511633 |
9 | 78177233843644 |
10 | 20111100122011 |
11 | 64540847a6098 |
12 | 23097ba8a61b7 |
13 | b2b6126a4cc2 |
14 | 4d754d5b23a3 |
15 | 24d20883a8e1 |
hex | 124a7afa939b |
20111100122011 has 4 divisors (see below), whose sum is σ = 20111462272224. Its totient is φ = 20110737971800.
The previous prime is 20111100121963. The next prime is 20111100122051. The reversal of 20111100122011 is 11022100111102.
It is a happy number.
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 20111100122011 - 229 = 20110563251099 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20111100121982 and 20111100122000.
It is not an unprimeable number, because it can be changed into a prime (20111100122051) 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, 180991795 + ... + 181102876.
It is an arithmetic number, because the mean of its divisors is an integer number (5027865568056).
Almost surely, 220111100122011 is an apocalyptic number.
20111100122011 is a deficient number, since it is larger than the sum of its proper divisors (362150213).
20111100122011 is an equidigital number, since it uses as much as digits as its factorization.
20111100122011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 362150212.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20111100122011 its reverse (11022100111102), we get a palindrome (31133200233113).
The spelling of 20111100122011 in words is "twenty trillion, one hundred eleven billion, one hundred million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •