Base | Representation |
---|---|
bin | 10100101011100000… |
… | …00010000011101001 |
3 | 1001122201222212010122 |
4 | 22111300002003221 |
5 | 140214144043423 |
6 | 5033401253025 |
7 | 542061154166 |
oct | 122560020351 |
9 | 31581885118 |
10 | 11102331113 |
11 | 4787a81765 |
12 | 219a194175 |
13 | 107c1a61c3 |
14 | 77470b06d |
15 | 44ea548c8 |
hex | 295c020e9 |
11102331113 has 8 divisors (see below), whose sum is σ = 11186985600. Its totient is φ = 11017979280.
The previous prime is 11102331101. The next prime is 11102331179. The reversal of 11102331113 is 31113320111.
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 11102331113 - 218 = 11102068969 is a prime.
It is a super-2 number, since 2×111023311132 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11102331091 and 11102331100.
It is not an unprimeable number, because it can be changed into a prime (11102331013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1745 + ... + 149022.
It is an arithmetic number, because the mean of its divisors is an integer number (1398373200).
Almost surely, 211102331113 is an apocalyptic number.
It is an amenable number.
11102331113 is a deficient number, since it is larger than the sum of its proper divisors (84654487).
11102331113 is a wasteful number, since it uses less digits than its factorization.
11102331113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151327.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 11102331113 its reverse (31113320111), we get a palindrome (42215651224).
The spelling of 11102331113 in words is "eleven billion, one hundred two million, three hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •