Base | Representation |
---|---|
bin | 1100011001011111001… |
… | …0111110101010110101 |
3 | 202100210100022020221212 |
4 | 3012113302332222311 |
5 | 11442211012333023 |
6 | 241503443451205 |
7 | 21250225104311 |
oct | 3062762765265 |
9 | 670710266855 |
10 | 213000121013 |
11 | 82373019569 |
12 | 35345386b05 |
13 | 17116733c84 |
14 | a44887cb41 |
15 | 58198ebe78 |
hex | 3197cbeab5 |
213000121013 has 2 divisors, whose sum is σ = 213000121014. Its totient is φ = 213000121012.
The previous prime is 213000121003. The next prime is 213000121027. The reversal of 213000121013 is 310121000312.
It is an a-pointer prime, because the next prime (213000121027) can be obtained adding 213000121013 to its sum of digits (14).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 208175012644 + 4825108369 = 456262^2 + 69463^2 .
It is a cyclic number.
It is not a de Polignac number, because 213000121013 - 24 = 213000120997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213000121003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106500060506 + 106500060507.
It is an arithmetic number, because the mean of its divisors is an integer number (106500060507).
Almost surely, 2213000121013 is an apocalyptic number.
It is an amenable number.
213000121013 is a deficient number, since it is larger than the sum of its proper divisors (1).
213000121013 is an equidigital number, since it uses as much as digits as its factorization.
213000121013 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 14.
Adding to 213000121013 its reverse (310121000312), we get a palindrome (523121121325).
The spelling of 213000121013 in words is "two hundred thirteen billion, one hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •