Base | Representation |
---|---|
bin | 1010000111011001100000… |
… | …0111000111110010101111 |
3 | 1110101021101210112111201022 |
4 | 2201312120013013302233 |
5 | 2424211302404124403 |
6 | 35353251200204355 |
7 | 2225361015652100 |
oct | 241663007076257 |
9 | 43337353474638 |
10 | 11122222333103 |
11 | 35a89a9607862 |
12 | 12b76899096bb |
13 | 628a89b5c10b |
14 | 2a6465ad03a7 |
15 | 1444ab7ddd38 |
hex | a1d981c7caf |
11122222333103 has 12 divisors (see below), whose sum is σ = 12940050434760. Its totient is φ = 9531892852272.
The previous prime is 11122222333093. The next prime is 11122222333133. The reversal of 11122222333103 is 30133322222111.
It is not a de Polignac number, because 11122222333103 - 26 = 11122222333039 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11122222333133) 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, 16822076 + ... + 17470737.
It is an arithmetic number, because the mean of its divisors is an integer number (1078337536230).
Almost surely, 211122222333103 is an apocalyptic number.
11122222333103 is a deficient number, since it is larger than the sum of its proper divisors (1817828101657).
11122222333103 is an equidigital number, since it uses as much as digits as its factorization.
11122222333103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34299446 (or 34299439 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 11122222333103 its reverse (30133322222111), we get a palindrome (41255544555214).
The spelling of 11122222333103 in words is "eleven trillion, one hundred twenty-two billion, two hundred twenty-two million, three hundred thirty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •