Base | Representation |
---|---|
bin | 10000000011011011110… |
… | …110110111111100100011 |
3 | 10220110112220211221101221 |
4 | 100003123312313330203 |
5 | 121033323224114021 |
6 | 2202445253235511 |
7 | 142463221113535 |
oct | 20033366677443 |
9 | 3813486757357 |
10 | 1103200223011 |
11 | 3959568469a7 |
12 | 159983632b97 |
13 | 80053ac4463 |
14 | 3b57650d855 |
15 | 1da6b8e5241 |
hex | 100dbdb7f23 |
1103200223011 has 2 divisors, whose sum is σ = 1103200223012. Its totient is φ = 1103200223010.
The previous prime is 1103200222997. The next prime is 1103200223023. The reversal of 1103200223011 is 1103220023011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1103200223011 - 215 = 1103200190243 is a prime.
It is a super-2 number, since 2×11032002230112 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1103200223611) 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 as a sum of consecutive naturals, namely, 551600111505 + 551600111506.
It is an arithmetic number, because the mean of its divisors is an integer number (551600111506).
Almost surely, 21103200223011 is an apocalyptic number.
1103200223011 is a deficient number, since it is larger than the sum of its proper divisors (1).
1103200223011 is an equidigital number, since it uses as much as digits as its factorization.
1103200223011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1103200223011 its reverse (1103220023011), we get a palindrome (2206420246022).
The spelling of 1103200223011 in words is "one trillion, one hundred three billion, two hundred million, two hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •