Base | Representation |
---|---|
bin | 1001001001010101101111… |
… | …10001100101111110011001 |
3 | 2122012200220020020021120111 |
4 | 10210222313301211332121 |
5 | 10114004110222023001 |
6 | 110435214101124321 |
7 | 4144024041156652 |
oct | 444526761457631 |
9 | 78180806207514 |
10 | 20112120111001 |
11 | 64545585319a6 |
12 | 2309a443b96a1 |
13 | b2b745ac0599 |
14 | 4d7608c44529 |
15 | 24d268169851 |
hex | 124ab7c65f99 |
20112120111001 has 2 divisors, whose sum is σ = 20112120111002. Its totient is φ = 20112120111000.
The previous prime is 20112120110987. The next prime is 20112120111091. The reversal of 20112120111001 is 10011102121102.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17051985654025 + 3060134456976 = 4129405^2 + 1749324^2 .
It is a cyclic number.
It is not a de Polignac number, because 20112120111001 - 233 = 20103530176409 is a prime.
It is a super-2 number, since 2×201121201110012 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20112120111091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10056060055500 + 10056060055501.
It is an arithmetic number, because the mean of its divisors is an integer number (10056060055501).
Almost surely, 220112120111001 is an apocalyptic number.
It is an amenable number.
20112120111001 is a deficient number, since it is larger than the sum of its proper divisors (1).
20112120111001 is an equidigital number, since it uses as much as digits as its factorization.
20112120111001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20112120111001 its reverse (10011102121102), we get a palindrome (30123222232103).
The spelling of 20112120111001 in words is "twenty trillion, one hundred twelve billion, one hundred twenty million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.724 sec. • engine limits •