Base | Representation |
---|---|
bin | 10100101011100101… |
… | …01100101101110011 |
3 | 1001122210022101000012 |
4 | 22111302230231303 |
5 | 140214333431011 |
6 | 5033424245135 |
7 | 542100125144 |
oct | 122562545563 |
9 | 31583271005 |
10 | 11103030131 |
11 | 4788409966 |
12 | 219a4707ab |
13 | 107c38c41b |
14 | 77484dacb |
15 | 44eb41a8b |
hex | 295cacb73 |
11103030131 has 4 divisors (see below), whose sum is σ = 11103246672. Its totient is φ = 11102813592.
The previous prime is 11103030077. The next prime is 11103030137. The reversal of 11103030131 is 13103030111.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13103030111 = 439 ⋅29847449.
It is a cyclic number.
It is not a de Polignac number, because 11103030131 - 222 = 11098835827 is a prime.
It is a super-2 number, since 2×111030301312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11103030137) 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 3 ways as a sum of consecutive naturals, for example, 16805 + ... + 149961.
It is an arithmetic number, because the mean of its divisors is an integer number (2775811668).
Almost surely, 211103030131 is an apocalyptic number.
11103030131 is a deficient number, since it is larger than the sum of its proper divisors (216541).
11103030131 is an equidigital number, since it uses as much as digits as its factorization.
11103030131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216540.
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 11103030131 its reverse (13103030111), we get a palindrome (24206060242).
The spelling of 11103030131 in words is "eleven billion, one hundred three million, thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •