Base | Representation |
---|---|
bin | 1001001001010101101111… |
… | …11001100110101010111001 |
3 | 2122012200220101011222020021 |
4 | 10210222313321212222321 |
5 | 10114004111241223001 |
6 | 110435214214130441 |
7 | 4144024065054262 |
oct | 444526771465271 |
9 | 78180811158207 |
10 | 20112122211001 |
11 | 6454559736737 |
12 | 2309a45050a21 |
13 | b2b7463773a2 |
14 | 4d760922d969 |
15 | 24d268431ba1 |
hex | 124ab7e66ab9 |
20112122211001 has 4 divisors (see below), whose sum is σ = 20113303834404. Its totient is φ = 20110940587600.
The previous prime is 20112122210969. The next prime is 20112122211019. The reversal of 20112122211001 is 10011222121102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 19167190461225 + 944931749776 = 4378035^2 + 972076^2 .
It is a cyclic number.
It is not a de Polignac number, because 20112122211001 - 25 = 20112122210969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20112122211101) 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, 590786170 + ... + 590820211.
It is an arithmetic number, because the mean of its divisors is an integer number (5028325958601).
Almost surely, 220112122211001 is an apocalyptic number.
It is an amenable number.
20112122211001 is a deficient number, since it is larger than the sum of its proper divisors (1181623403).
20112122211001 is a wasteful number, since it uses less digits than its factorization.
20112122211001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1181623402.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 20112122211001 its reverse (10011222121102), we get a palindrome (30123344332103).
The spelling of 20112122211001 in words is "twenty trillion, one hundred twelve billion, one hundred twenty-two million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •