Base | Representation |
---|---|
bin | 1100010010011010111… |
… | …0000111010100100111 |
3 | 202011220010120120001111 |
4 | 3010212232013110213 |
5 | 11424314333122302 |
6 | 240551314205451 |
7 | 21152221031443 |
oct | 3044656072447 |
9 | 664803516044 |
10 | 211103020327 |
11 | 8158a173761 |
12 | 34ab5b83887 |
13 | 16ba36a6ca4 |
14 | a30892b823 |
15 | 57580b30d7 |
hex | 3126b87527 |
211103020327 has 2 divisors, whose sum is σ = 211103020328. Its totient is φ = 211103020326.
The previous prime is 211103020307. The next prime is 211103020333. The reversal of 211103020327 is 723020301112.
It is a happy number.
211103020327 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 is a cyclic number.
It is not a de Polignac number, because 211103020327 - 211 = 211103018279 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 211103020298 and 211103020307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211103020307) 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, 105551510163 + 105551510164.
It is an arithmetic number, because the mean of its divisors is an integer number (105551510164).
Almost surely, 2211103020327 is an apocalyptic number.
211103020327 is a deficient number, since it is larger than the sum of its proper divisors (1).
211103020327 is an equidigital number, since it uses as much as digits as its factorization.
211103020327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 22.
Adding to 211103020327 its reverse (723020301112), we get a palindrome (934123321439).
The spelling of 211103020327 in words is "two hundred eleven billion, one hundred three million, twenty thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •