Base | Representation |
---|---|
bin | 1100011010001110110… |
… | …1111011010010000001 |
3 | 202101022021122102010012 |
4 | 3012203231323102001 |
5 | 11443113212414014 |
6 | 241535350314305 |
7 | 21255204100436 |
oct | 3064355732201 |
9 | 671267572105 |
10 | 213200123009 |
11 | 82465a02a75 |
12 | 353a0358995 |
13 | 17148cbc153 |
14 | a467261b8d |
15 | 582c256c3e |
hex | 31a3b7b481 |
213200123009 has 2 divisors, whose sum is σ = 213200123010. Its totient is φ = 213200123008.
The previous prime is 213200122999. The next prime is 213200123011. The reversal of 213200123009 is 900321002312.
213200123009 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., 137077657600 + 76122465409 = 370240^2 + 275903^2 .
It is a cyclic number.
It is not a de Polignac number, because 213200123009 - 232 = 208905155713 is a prime.
Together with 213200123011, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (213200123029) 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, 106600061504 + 106600061505.
It is an arithmetic number, because the mean of its divisors is an integer number (106600061505).
Almost surely, 2213200123009 is an apocalyptic number.
It is an amenable number.
213200123009 is a deficient number, since it is larger than the sum of its proper divisors (1).
213200123009 is an equidigital number, since it uses as much as digits as its factorization.
213200123009 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 23.
The spelling of 213200123009 in words is "two hundred thirteen billion, two hundred million, one hundred twenty-three thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •