Base | Representation |
---|---|
bin | 110000011011101101001101… |
… | …011100011000100000111101 |
3 | 1000221012120120020121201012022 |
4 | 300123231031130120200331 |
5 | 210404424343244044242 |
6 | 2033011311441245525 |
7 | 62603323246425065 |
oct | 6033551534304075 |
9 | 1027176506551168 |
10 | 213010202331197 |
11 | 61965135062517 |
12 | 1ba829799338a5 |
13 | 91b1a11826b5b |
14 | 3a85a6a9da3a5 |
15 | 1995d3e24e0d2 |
hex | c1bb4d71883d |
213010202331197 has 2 divisors, whose sum is σ = 213010202331198. Its totient is φ = 213010202331196.
The previous prime is 213010202331149. The next prime is 213010202331203. The reversal of 213010202331197 is 791133202010312.
213010202331197 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 204913184114521 + 8097018216676 = 14314789^2 + 2845526^2 .
It is a cyclic number.
It is not a de Polignac number, because 213010202331197 - 26 = 213010202331133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213010202331097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106505101165598 + 106505101165599.
It is an arithmetic number, because the mean of its divisors is an integer number (106505101165599).
Almost surely, 2213010202331197 is an apocalyptic number.
It is an amenable number.
213010202331197 is a deficient number, since it is larger than the sum of its proper divisors (1).
213010202331197 is an equidigital number, since it uses as much as digits as its factorization.
213010202331197 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13608, while the sum is 35.
The spelling of 213010202331197 in words is "two hundred thirteen trillion, ten billion, two hundred two million, three hundred thirty-one thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •