Base | Representation |
---|---|
bin | 101110001110100110000110… |
… | …010111001111011011100101 |
3 | 222122212112200222112211122022 |
4 | 232032212012113033123211 |
5 | 203122040233002131323 |
6 | 2000224431453312525 |
7 | 60552613450261223 |
oct | 5616460627173345 |
9 | 878775628484568 |
10 | 203313121130213 |
11 | 59866679574696 |
12 | 1a977540a95745 |
13 | 895a464120853 |
14 | 382c59c519b13 |
15 | 1878992d6e4c8 |
hex | b8e9865cf6e5 |
203313121130213 has 2 divisors, whose sum is σ = 203313121130214. Its totient is φ = 203313121130212.
The previous prime is 203313121130167. The next prime is 203313121130267. The reversal of 203313121130213 is 312031121313302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 197160970125604 + 6152151004609 = 14041402^2 + 2480353^2 .
It is a cyclic number.
It is not a de Polignac number, because 203313121130213 - 226 = 203313054021349 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (203313121930213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101656560565106 + 101656560565107.
It is an arithmetic number, because the mean of its divisors is an integer number (101656560565107).
Almost surely, 2203313121130213 is an apocalyptic number.
It is an amenable number.
203313121130213 is a deficient number, since it is larger than the sum of its proper divisors (1).
203313121130213 is an equidigital number, since it uses as much as digits as its factorization.
203313121130213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 203313121130213 its reverse (312031121313302), we get a palindrome (515344242443515).
The spelling of 203313121130213 in words is "two hundred three trillion, three hundred thirteen billion, one hundred twenty-one million, one hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •