Base | Representation |
---|---|
bin | 1100011001011111101… |
… | …1000001101000101001 |
3 | 202100210111021102101002 |
4 | 3012113323001220221 |
5 | 11442212032332223 |
6 | 241504001004345 |
7 | 21250252041005 |
oct | 3062773015051 |
9 | 670714242332 |
10 | 213002230313 |
11 | 8237422a294 |
12 | 353460236b5 |
13 | 17116cc2092 |
14 | a448c6b705 |
15 | 5819bb6e28 |
hex | 3197ec1a29 |
213002230313 has 2 divisors, whose sum is σ = 213002230314. Its totient is φ = 213002230312.
The previous prime is 213002230289. The next prime is 213002230379. The reversal of 213002230313 is 313032200312.
213002230313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 167614910464 + 45387319849 = 409408^2 + 213043^2 .
It is a cyclic number.
It is not a de Polignac number, because 213002230313 - 26 = 213002230249 is a prime.
It is not a weakly prime, because it can be changed into another prime (213002230513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106501115156 + 106501115157.
It is an arithmetic number, because the mean of its divisors is an integer number (106501115157).
Almost surely, 2213002230313 is an apocalyptic number.
It is an amenable number.
213002230313 is a deficient number, since it is larger than the sum of its proper divisors (1).
213002230313 is an equidigital number, since it uses as much as digits as its factorization.
213002230313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 213002230313 its reverse (313032200312), we get a palindrome (526034430625).
The spelling of 213002230313 in words is "two hundred thirteen billion, two million, two hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •