Base | Representation |
---|---|
bin | 110011101100101001… |
… | …1110001000100101011 |
3 | 101121120011202100210000 |
4 | 1213121103301010223 |
5 | 3304332111120021 |
6 | 123000224154043 |
7 | 11010115412505 |
oct | 1473123610453 |
9 | 347504670700 |
10 | 111020020011 |
11 | 430a09a825a |
12 | 19624468923 |
13 | a613926644 |
14 | 5532862d75 |
15 | 2d4b930b26 |
hex | 19d94f112b |
111020020011 has 20 divisors (see below), whose sum is σ = 167944031200. Its totient is φ = 73076464656.
The previous prime is 111020019973. The next prime is 111020020063. The reversal of 111020020011 is 110020020111.
It is a happy number.
It is not a de Polignac number, because 111020020011 - 219 = 111019495723 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111020019975 and 111020020002.
It is not an unprimeable number, because it can be changed into a prime (111020027011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 8668396 + ... + 8681193.
It is an arithmetic number, because the mean of its divisors is an integer number (8397201560).
Almost surely, 2111020020011 is an apocalyptic number.
111020020011 is a deficient number, since it is larger than the sum of its proper divisors (56924011189).
111020020011 is an equidigital number, since it uses as much as digits as its factorization.
111020020011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17349680 (or 17349671 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 111020020011 its reverse (110020020111), we get a palindrome (221040040122).
The spelling of 111020020011 in words is "one hundred eleven billion, twenty million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •