Base | Representation |
---|---|
bin | 11001001111100011011100… |
… | …111010100111010111011001 |
3 | 112120002102002011001102000212 |
4 | 121033203130322213113121 |
5 | 104022423000340120441 |
6 | 1032041521002140505 |
7 | 32245634421240623 |
oct | 3117433472472731 |
9 | 476072064042025 |
10 | 111020021020121 |
11 | 32413365641904 |
12 | 105505104b1735 |
13 | 49c41b23c4465 |
14 | 1d5b57d381c13 |
15 | cc7d43997eeb |
hex | 64f8dcea75d9 |
111020021020121 has 8 divisors (see below), whose sum is σ = 116941769950080. Its totient is φ = 105106131083088.
The previous prime is 111020021020081. The next prime is 111020021020127. The reversal of 111020021020121 is 121020120020111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 111020021020121 - 234 = 111002841150937 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111020021020096 and 111020021020105.
It is not an unprimeable number, because it can be changed into a prime (111020021020127) 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, 1964719226 + ... + 1964775731.
It is an arithmetic number, because the mean of its divisors is an integer number (14617721243760).
Almost surely, 2111020021020121 is an apocalyptic number.
It is an amenable number.
111020021020121 is a deficient number, since it is larger than the sum of its proper divisors (5921748929959).
111020021020121 is a wasteful number, since it uses less digits than its factorization.
111020021020121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3929496463.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 111020021020121 its reverse (121020120020111), we get a palindrome (232040141040232).
The spelling of 111020021020121 in words is "one hundred eleven trillion, twenty billion, twenty-one million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •