Base | Representation |
---|---|
bin | 1001001001010101101111… |
… | …10001100101111110101101 |
3 | 2122012200220020020021121020 |
4 | 10210222313301211332231 |
5 | 10114004110222023041 |
6 | 110435214101124353 |
7 | 4144024041160011 |
oct | 444526761457655 |
9 | 78180806207536 |
10 | 20112120111021 |
11 | 6454558531a14 |
12 | 2309a443b96b9 |
13 | b2b745ac05b3 |
14 | 4d7608c44541 |
15 | 24d268169866 |
hex | 124ab7c65fad |
20112120111021 has 8 divisors (see below), whose sum is σ = 27982080154560. Its totient is φ = 12825120070752.
The previous prime is 20112120111001. The next prime is 20112120111091. The reversal of 20112120111021 is 12011102121102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20112120111021 - 214 = 20112120094637 is a prime.
It is a super-2 number, since 2×201121201110212 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20112120111001) 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, 145740000736 + ... + 145740000873.
It is an arithmetic number, because the mean of its divisors is an integer number (3497760019320).
Almost surely, 220112120111021 is an apocalyptic number.
It is an amenable number.
20112120111021 is a deficient number, since it is larger than the sum of its proper divisors (7869960043539).
20112120111021 is a wasteful number, since it uses less digits than its factorization.
20112120111021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 291480001635.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 20112120111021 its reverse (12011102121102), we get a palindrome (32123222232123).
The spelling of 20112120111021 in words is "twenty trillion, one hundred twelve billion, one hundred twenty million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •