Base | Representation |
---|---|
bin | 1100011001110111100… |
… | …0000010101001011011 |
3 | 202101001110012220100202 |
4 | 3012131320002221123 |
5 | 11442413120030243 |
6 | 241521525452415 |
7 | 21252604026203 |
oct | 3063570025133 |
9 | 671043186322 |
10 | 213102111323 |
11 | 8241564a382 |
12 | 3537357110b |
13 | 171318c367a |
14 | a45822b403 |
15 | 58238464b8 |
hex | 319de02a5b |
213102111323 has 2 divisors, whose sum is σ = 213102111324. Its totient is φ = 213102111322.
The previous prime is 213102111307. The next prime is 213102111359. The reversal of 213102111323 is 323111201312.
It is a happy number.
213102111323 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 is a cyclic number.
It is not a de Polignac number, because 213102111323 - 24 = 213102111307 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 213102111295 and 213102111304.
It is not a weakly prime, because it can be changed into another prime (213102111023) 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, 106551055661 + 106551055662.
It is an arithmetic number, because the mean of its divisors is an integer number (106551055662).
Almost surely, 2213102111323 is an apocalyptic number.
213102111323 is a deficient number, since it is larger than the sum of its proper divisors (1).
213102111323 is an equidigital number, since it uses as much as digits as its factorization.
213102111323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 213102111323 its reverse (323111201312), we get a palindrome (536213312635).
The spelling of 213102111323 in words is "two hundred thirteen billion, one hundred two million, one hundred eleven thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •