Base | Representation |
---|---|
bin | 110100101000010001… |
… | …0101001110011100111 |
3 | 101210201120211202111021 |
4 | 1221100202221303213 |
5 | 3322431211123421 |
6 | 123530523352011 |
7 | 11110515433516 |
oct | 1512042516347 |
9 | 353646752437 |
10 | 113020411111 |
11 | 43a28091743 |
12 | 19aa2382607 |
13 | a8721a9a0a |
14 | 56823c067d |
15 | 2e1736e341 |
hex | 1a508a9ce7 |
113020411111 has 4 divisors (see below), whose sum is σ = 115152871752. Its totient is φ = 110887950472.
The previous prime is 113020411099. The next prime is 113020411121. The reversal of 113020411111 is 111114020311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 111114020311 = 7 ⋅15873431473.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113020411111 is a prime.
It is a super-2 number, since 2×1130204111112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113020411121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1066230241 + ... + 1066230346.
It is an arithmetic number, because the mean of its divisors is an integer number (28788217938).
Almost surely, 2113020411111 is an apocalyptic number.
113020411111 is a deficient number, since it is larger than the sum of its proper divisors (2132460641).
113020411111 is an equidigital number, since it uses as much as digits as its factorization.
113020411111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2132460640.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 113020411111 its reverse (111114020311), we get a palindrome (224134431422).
The spelling of 113020411111 in words is "one hundred thirteen billion, twenty million, four hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •