Base | Representation |
---|---|
bin | 110000011101001011010001… |
… | …011011101110101001001101 |
3 | 1000221120020021000102200111221 |
4 | 300131023101123232221031 |
5 | 210413103214424000023 |
6 | 2033125533441243341 |
7 | 62613530141101351 |
oct | 6035132133565115 |
9 | 1027506230380457 |
10 | 213111201000013 |
11 | 619a3a53192248 |
12 | 1ba9a466033551 |
13 | 91bb3b91c8894 |
14 | 3a8a8cc53d461 |
15 | 19987a0ea585d |
hex | c1d2d16eea4d |
213111201000013 has 2 divisors, whose sum is σ = 213111201000014. Its totient is φ = 213111201000012.
The previous prime is 213111201000007. The next prime is 213111201000037. The reversal of 213111201000013 is 310000102111312.
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., 164083239012004 + 49027961988009 = 12809498^2 + 7001997^2 .
It is a cyclic number.
It is not a de Polignac number, because 213111201000013 - 237 = 212973762046541 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213111201000073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106555600500006 + 106555600500007.
It is an arithmetic number, because the mean of its divisors is an integer number (106555600500007).
Almost surely, 2213111201000013 is an apocalyptic number.
It is an amenable number.
213111201000013 is a deficient number, since it is larger than the sum of its proper divisors (1).
213111201000013 is an equidigital number, since it uses as much as digits as its factorization.
213111201000013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 213111201000013 its reverse (310000102111312), we get a palindrome (523111303111325).
The spelling of 213111201000013 in words is "two hundred thirteen trillion, one hundred eleven billion, two hundred one million, thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •