Base | Representation |
---|---|
bin | 10000001010101100110… |
… | …001011011010000001011 |
3 | 10221012200111212211121002 |
4 | 100022230301123100023 |
5 | 121200312022401303 |
6 | 2210215250005215 |
7 | 143160422613035 |
oct | 20125461332013 |
9 | 3835614784532 |
10 | 1111000200203 |
11 | 399199716243 |
12 | 15b39b87680b |
13 | 809c7a72a8a |
14 | 3bab63cac55 |
15 | 1dd7657e788 |
hex | 102acc5b40b |
1111000200203 has 2 divisors, whose sum is σ = 1111000200204. Its totient is φ = 1111000200202.
The previous prime is 1111000200181. The next prime is 1111000200209. The reversal of 1111000200203 is 3020020001111.
It is a strong prime.
It is an emirp because it is prime and its reverse (3020020001111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1111000200203 - 26 = 1111000200139 is a prime.
It is a super-4 number, since 4×11110002002034 (a number of 49 digits) contains 4444 as substring. Note that it is a super-d number also for d = 3, 2.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (1111000200209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555500100101 + 555500100102.
It is an arithmetic number, because the mean of its divisors is an integer number (555500100102).
Almost surely, 21111000200203 is an apocalyptic number.
1111000200203 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111000200203 is an equidigital number, since it uses as much as digits as its factorization.
1111000200203 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 1111000200203 its reverse (3020020001111), we get a palindrome (4131020201314).
The spelling of 1111000200203 in words is "one trillion, one hundred eleven billion, two hundred thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •