Base | Representation |
---|---|
bin | 101110001010000101010111… |
… | …101110101110001101011101 |
3 | 222121202220111011012002202102 |
4 | 232022011113232232031131 |
5 | 203102000322341024013 |
6 | 1555430200500334445 |
7 | 60521330042505131 |
oct | 5612052756561535 |
9 | 877686434162672 |
10 | 203003101111133 |
11 | 5975714a32a794 |
12 | 1a92743b9a4425 |
13 | 893715841578b |
14 | 381b58c7233c1 |
15 | 187089ab9ad58 |
hex | b8a157bae35d |
203003101111133 has 2 divisors, whose sum is σ = 203003101111134. Its totient is φ = 203003101111132.
The previous prime is 203003101111123. The next prime is 203003101111229. The reversal of 203003101111133 is 331111101300302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 156519040713049 + 46484060398084 = 12510757^2 + 6817922^2 .
It is a cyclic number.
It is not a de Polignac number, because 203003101111133 - 210 = 203003101110109 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (203003101111123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101501550555566 + 101501550555567.
It is an arithmetic number, because the mean of its divisors is an integer number (101501550555567).
Almost surely, 2203003101111133 is an apocalyptic number.
It is an amenable number.
203003101111133 is a deficient number, since it is larger than the sum of its proper divisors (1).
203003101111133 is an equidigital number, since it uses as much as digits as its factorization.
203003101111133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 203003101111133 its reverse (331111101300302), we get a palindrome (534114202411435).
The spelling of 203003101111133 in words is "two hundred three trillion, three billion, one hundred one million, one hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •