Base | Representation |
---|---|
bin | 1100010101111101101… |
… | …0001101010101000001 |
3 | 202021100102012120201001 |
4 | 3011133122031111001 |
5 | 11433241322301421 |
6 | 241225531212001 |
7 | 21214620065332 |
oct | 3053732152501 |
9 | 667312176631 |
10 | 212054103361 |
11 | 81a280164a1 |
12 | 351205a7001 |
13 | 16cc5747a09 |
14 | a398d84289 |
15 | 57b1830691 |
hex | 315f68d541 |
212054103361 has 2 divisors, whose sum is σ = 212054103362. Its totient is φ = 212054103360.
The previous prime is 212054103343. The next prime is 212054103367. The reversal of 212054103361 is 163301450212.
212054103361 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., 173968239025 + 38085864336 = 417095^2 + 195156^2 .
It is a cyclic number.
It is not a de Polignac number, because 212054103361 - 211 = 212054101313 is a prime.
It is not a weakly prime, because it can be changed into another prime (212054103367) 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, 106027051680 + 106027051681.
It is an arithmetic number, because the mean of its divisors is an integer number (106027051681).
Almost surely, 2212054103361 is an apocalyptic number.
It is an amenable number.
212054103361 is a deficient number, since it is larger than the sum of its proper divisors (1).
212054103361 is an equidigital number, since it uses as much as digits as its factorization.
212054103361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 212054103361 its reverse (163301450212), we get a palindrome (375355553573).
The spelling of 212054103361 in words is "two hundred twelve billion, fifty-four million, one hundred three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •