Base | Representation |
---|---|
bin | 11001001111100011011011… |
… | …101110101101011011011011 |
3 | 112120002102000202121110221211 |
4 | 121033203123232231123123 |
5 | 104022422430241401021 |
6 | 1032041515011443551 |
7 | 32245634060144632 |
oct | 3117433356553333 |
9 | 476072022543854 |
10 | 111020001122011 |
11 | 32413355391093 |
12 | 105505058b65b7 |
13 | 49c41ab248527 |
14 | 1d5b57a882519 |
15 | cc7d41d673e1 |
hex | 64f8dbbad6db |
111020001122011 has 8 divisors (see below), whose sum is σ = 114848420212800. Its totient is φ = 107191591577280.
The previous prime is 111020001122003. The next prime is 111020001122033. The reversal of 111020001122011 is 110221100020111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 111020001122011 - 23 = 111020001122003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111020001121982 and 111020001122000.
It is not an unprimeable number, because it can be changed into a prime (111020001122071) 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, 27705831 + ... + 31458751.
It is an arithmetic number, because the mean of its divisors is an integer number (14356052526600).
Almost surely, 2111020001122011 is an apocalyptic number.
111020001122011 is a deficient number, since it is larger than the sum of its proper divisors (3828419090789).
111020001122011 is a wasteful number, since it uses less digits than its factorization.
111020001122011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4773029.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 111020001122011 its reverse (110221100020111), we get a palindrome (221241101142122).
The spelling of 111020001122011 in words is "one hundred eleven trillion, twenty billion, one million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •