Base | Representation |
---|---|
bin | 10100101110111011… |
… | …10010011111110111 |
3 | 1001201202010122001100 |
4 | 22113131302133313 |
5 | 140244030300343 |
6 | 5040310101143 |
7 | 542560546662 |
oct | 122735623767 |
9 | 31652118040 |
10 | 11131103223 |
11 | 47a2243669 |
12 | 21a794a7b3 |
13 | 108513b316 |
14 | 77847a6d9 |
15 | 4523399d3 |
hex | 2977727f7 |
11131103223 has 12 divisors (see below), whose sum is σ = 16318235128. Its totient is φ = 7309977840.
The previous prime is 11131103197. The next prime is 11131103233. The reversal of 11131103223 is 32230113111.
It is not a de Polignac number, because 11131103223 - 28 = 11131102967 is a prime.
It is a super-2 number, since 2×111311032232 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11131103196 and 11131103205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11131103233) 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 11 ways as a sum of consecutive naturals, for example, 9229168 + ... + 9230373.
Almost surely, 211131103223 is an apocalyptic number.
11131103223 is a deficient number, since it is larger than the sum of its proper divisors (5187131905).
11131103223 is a wasteful number, since it uses less digits than its factorization.
11131103223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18459614 (or 18459611 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 11131103223 its reverse (32230113111), we get a palindrome (43361216334).
The spelling of 11131103223 in words is "eleven billion, one hundred thirty-one million, one hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •