Base | Representation |
---|---|
bin | 110011101100011100… |
… | …1110000000010001011 |
3 | 101121112200220212111102 |
4 | 1213120321300002023 |
5 | 3304323334400021 |
6 | 122555422052015 |
7 | 11010003426230 |
oct | 1473071600213 |
9 | 347480825442 |
10 | 111013200011 |
11 | 4309806a29a |
12 | 1962211a00b |
13 | a6123a933c |
14 | 55319a9787 |
15 | 2d4b03500b |
hex | 19d8e7008b |
111013200011 has 16 divisors (see below), whose sum is σ = 128813498880. Its totient is φ = 93699270720.
The previous prime is 111013199923. The next prime is 111013200041. The reversal of 111013200011 is 110002310111.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 111013200011 - 210 = 111013198987 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111013199965 and 111013200001.
It is not an unprimeable number, because it can be changed into a prime (111013200041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1266575 + ... + 1351383.
It is an arithmetic number, because the mean of its divisors is an integer number (8050843680).
Almost surely, 2111013200011 is an apocalyptic number.
111013200011 is a deficient number, since it is larger than the sum of its proper divisors (17800298869).
111013200011 is an equidigital number, since it uses as much as digits as its factorization.
111013200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87674.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 111013200011 its reverse (110002310111), we get a palindrome (221015510122).
The spelling of 111013200011 in words is "one hundred eleven billion, thirteen million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •