Base | Representation |
---|---|
bin | 101110001011101001111110… |
… | …001010100000110111001111 |
3 | 222122011020022011222221201002 |
4 | 232023221332022200313033 |
5 | 203110233033222104403 |
6 | 1555551543242410515 |
7 | 60532202621045126 |
oct | 5613517612406717 |
9 | 878136264887632 |
10 | 203111120113103 |
11 | 59798a40231744 |
12 | 1a944367200a3b |
13 | 89443b138c3a7 |
14 | 38228b8796abd |
15 | 18735bddd6188 |
hex | b8ba7e2a0dcf |
203111120113103 has 16 divisors (see below), whose sum is σ = 206810557212672. Its totient is φ = 199435120500000.
The previous prime is 203111120113087. The next prime is 203111120113163. The reversal of 203111120113103 is 301311021111302.
It is a cyclic number.
It is not a de Polignac number, because 203111120113103 - 24 = 203111120113087 is a prime.
It is a super-2 number, since 2×2031111201131032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203111120113163) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 205357025 + ... + 206343717.
It is an arithmetic number, because the mean of its divisors is an integer number (12925659825792).
Almost surely, 2203111120113103 is an apocalyptic number.
203111120113103 is a deficient number, since it is larger than the sum of its proper divisors (3699437099569).
203111120113103 is a wasteful number, since it uses less digits than its factorization.
203111120113103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 998566.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 203111120113103 its reverse (301311021111302), we get a palindrome (504422141224405).
The spelling of 203111120113103 in words is "two hundred three trillion, one hundred eleven billion, one hundred twenty million, one hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •