Base | Representation |
---|---|
bin | 11001001111100011100010… |
… | …111100101000011010110101 |
3 | 112120002102100012110111020000 |
4 | 121033203202330220122311 |
5 | 104022423202241241041 |
6 | 1032041535015101513 |
7 | 32245640060326011 |
oct | 3117434274503265 |
9 | 476072305414200 |
10 | 111020122212021 |
11 | 32413407777880 |
12 | 1055053a371899 |
13 | 49c41ca364619 |
14 | 1d5b58c9a3541 |
15 | cc7d4c7d5bb6 |
hex | 64f8e2f286b5 |
111020122212021 has 40 divisors (see below), whose sum is σ = 180963928674144. Its totient is φ = 67269210475680.
The previous prime is 111020122211983. The next prime is 111020122212047. The reversal of 111020122212021 is 120212221020111.
It is not a de Polignac number, because 111020122212021 - 210 = 111020122210997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111020122211985 and 111020122212003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111020122212821) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 10729926 + ... + 18362231.
Almost surely, 2111020122212021 is an apocalyptic number.
111020122212021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
111020122212021 is a deficient number, since it is larger than the sum of its proper divisors (69943806462123).
111020122212021 is a wasteful number, since it uses less digits than its factorization.
111020122212021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29096463 (or 29096454 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 111020122212021 its reverse (120212221020111), we get a palindrome (231232343232132).
The spelling of 111020122212021 in words is "one hundred eleven trillion, twenty billion, one hundred twenty-two million, two hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •