Base | Representation |
---|---|
bin | 1100011001100110110… |
… | …0101101100001000111 |
3 | 202100212120100112001101 |
4 | 3012121230231201013 |
5 | 11442242200013302 |
6 | 241510543440531 |
7 | 21251063253232 |
oct | 3063154554107 |
9 | 670776315041 |
10 | 213032032327 |
11 | 8238a034a54 |
12 | 35353bb6147 |
13 | 17120227bca |
14 | a44cbc8419 |
15 | 581c602287 |
hex | 3199b2d847 |
213032032327 has 2 divisors, whose sum is σ = 213032032328. Its totient is φ = 213032032326.
The previous prime is 213032032319. The next prime is 213032032361. The reversal of 213032032327 is 723230230312.
213032032327 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 213032032327 - 23 = 213032032319 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 213032032295 and 213032032304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213032030327) 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, 106516016163 + 106516016164.
It is an arithmetic number, because the mean of its divisors is an integer number (106516016164).
Almost surely, 2213032032327 is an apocalyptic number.
213032032327 is a deficient number, since it is larger than the sum of its proper divisors (1).
213032032327 is an equidigital number, since it uses as much as digits as its factorization.
213032032327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 28.
Adding to 213032032327 its reverse (723230230312), we get a palindrome (936262262639).
The spelling of 213032032327 in words is "two hundred thirteen billion, thirty-two million, thirty-two thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •