Base | Representation |
---|---|
bin | 11001010000110001101011… |
… | …101001101110001010001011 |
3 | 112120101102220012011101210021 |
4 | 121100301223221232022023 |
5 | 104030312013122041021 |
6 | 1032144252054201311 |
7 | 32255000122604353 |
oct | 3120615351561213 |
9 | 476342805141707 |
10 | 111104020112011 |
11 | 32445a4a971903 |
12 | 10564853653237 |
13 | 49cc0aabc0524 |
14 | 1d6166b2b5b63 |
15 | cca10d0acc41 |
hex | 650c6ba6e28b |
111104020112011 has 8 divisors (see below), whose sum is σ = 111111658369664. Its totient is φ = 111096382178880.
The previous prime is 111104020112003. The next prime is 111104020112021. The reversal of 111104020112011 is 110211020401111.
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 111104020112011 - 23 = 111104020112003 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111104020112021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1195378801 + ... + 1195471741.
It is an arithmetic number, because the mean of its divisors is an integer number (13888957296208).
Almost surely, 2111104020112011 is an apocalyptic number.
111104020112011 is a deficient number, since it is larger than the sum of its proper divisors (7638257653).
111104020112011 is an equidigital number, since it uses as much as digits as its factorization.
111104020112011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162261.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 111104020112011 its reverse (110211020401111), we get a palindrome (221315040513122).
The spelling of 111104020112011 in words is "one hundred eleven trillion, one hundred four billion, twenty million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •