Base | Representation |
---|---|
bin | 10100100010111001… |
… | …00010001110001001 |
3 | 1001110201002200220211 |
4 | 22101130202032021 |
5 | 140042202023423 |
6 | 5022301321121 |
7 | 540223253230 |
oct | 122134421611 |
9 | 31421080824 |
10 | 11030111113 |
11 | 475023480a |
12 | 2179b661a1 |
13 | 106a23b088 |
14 | 768cabb17 |
15 | 44853b10d |
hex | 291722389 |
11030111113 has 4 divisors (see below), whose sum is σ = 12605841280. Its totient is φ = 9454380948.
The previous prime is 11030111093. The next prime is 11030111123. The reversal of 11030111113 is 31111103011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11030111113 - 221 = 11028013961 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11030111093 and 11030111102.
It is not an unprimeable number, because it can be changed into a prime (11030111123) 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, 787865073 + ... + 787865086.
It is an arithmetic number, because the mean of its divisors is an integer number (3151460320).
Almost surely, 211030111113 is an apocalyptic number.
It is an amenable number.
11030111113 is a deficient number, since it is larger than the sum of its proper divisors (1575730167).
11030111113 is an equidigital number, since it uses as much as digits as its factorization.
11030111113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1575730166.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 11030111113 its reverse (31111103011), we get a palindrome (42141214124).
The spelling of 11030111113 in words is "eleven billion, thirty million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •