Base | Representation |
---|---|
bin | 1100010011100110101… |
… | …1001110011101000001 |
3 | 202012201021222010121021 |
4 | 3010321223032131001 |
5 | 11430442240431314 |
6 | 241043034225441 |
7 | 21163132051114 |
oct | 3047153163501 |
9 | 665637863537 |
10 | 211421030209 |
11 | 81732729244 |
12 | 34b84585281 |
13 | 16c2453c40c |
14 | a338c6c57b |
15 | 5775e7d324 |
hex | 3139ace741 |
211421030209 has 2 divisors, whose sum is σ = 211421030210. Its totient is φ = 211421030208.
The previous prime is 211421030207. The next prime is 211421030251. The reversal of 211421030209 is 902030124112.
211421030209 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., 180367541809 + 31053488400 = 424697^2 + 176220^2 .
It is a cyclic number.
It is not a de Polignac number, because 211421030209 - 21 = 211421030207 is a prime.
Together with 211421030207, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (211421030201) 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, 105710515104 + 105710515105.
It is an arithmetic number, because the mean of its divisors is an integer number (105710515105).
Almost surely, 2211421030209 is an apocalyptic number.
It is an amenable number.
211421030209 is a deficient number, since it is larger than the sum of its proper divisors (1).
211421030209 is an equidigital number, since it uses as much as digits as its factorization.
211421030209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 25.
The spelling of 211421030209 in words is "two hundred eleven billion, four hundred twenty-one million, thirty thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •