Base | Representation |
---|---|
bin | 110000011101010100100101… |
… | …100111100110011110111101 |
3 | 1000221121012002002120211222012 |
4 | 300131110211213212132331 |
5 | 210413234211023124203 |
6 | 2033134310150101005 |
7 | 62614333044401231 |
oct | 6035244547463675 |
9 | 1027535062524865 |
10 | 213121203333053 |
11 | 619a8216250094 |
12 | 1baa039794a765 |
13 | 91bc321521c42 |
14 | 3a8b19ab0c5c1 |
15 | 1998b89174bd8 |
hex | c1d5259e67bd |
213121203333053 has 2 divisors, whose sum is σ = 213121203333054. Its totient is φ = 213121203333052.
The previous prime is 213121203333023. The next prime is 213121203333161. The reversal of 213121203333053 is 350333302121312.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 197997177895609 + 15124025437444 = 14071147^2 + 3888962^2 .
It is a cyclic number.
It is not a de Polignac number, because 213121203333053 - 214 = 213121203316669 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213121203333023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106560601666526 + 106560601666527.
It is an arithmetic number, because the mean of its divisors is an integer number (106560601666527).
Almost surely, 2213121203333053 is an apocalyptic number.
It is an amenable number.
213121203333053 is a deficient number, since it is larger than the sum of its proper divisors (1).
213121203333053 is an equidigital number, since it uses as much as digits as its factorization.
213121203333053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 29160, while the sum is 32.
Adding to 213121203333053 its reverse (350333302121312), we get a palindrome (563454505454365).
The spelling of 213121203333053 in words is "two hundred thirteen trillion, one hundred twenty-one billion, two hundred three million, three hundred thirty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •