Base | Representation |
---|---|
bin | 1100010010000010100… |
… | …0111100000001110101 |
3 | 202011122000121101112211 |
4 | 3010200220330001311 |
5 | 11424112224000203 |
6 | 240533231413421 |
7 | 21146541623314 |
oct | 3044050740165 |
9 | 664560541484 |
10 | 211001000053 |
11 | 81537622388 |
12 | 34a87984271 |
13 | 16b88506a6c |
14 | a2d917227b |
15 | 574e15ec6d |
hex | 3120a3c075 |
211001000053 has 2 divisors, whose sum is σ = 211001000054. Its totient is φ = 211001000052.
The previous prime is 211000999997. The next prime is 211001000059. The reversal of 211001000053 is 350000100112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 153305920849 + 57695079204 = 391543^2 + 240198^2 .
It is a cyclic number.
It is not a de Polignac number, because 211001000053 - 225 = 210967445621 is a prime.
It is a super-2 number, since 2×2110010000532 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211000999997 and 211001000042.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211001000059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105500500026 + 105500500027.
It is an arithmetic number, because the mean of its divisors is an integer number (105500500027).
Almost surely, 2211001000053 is an apocalyptic number.
It is an amenable number.
211001000053 is a deficient number, since it is larger than the sum of its proper divisors (1).
211001000053 is an equidigital number, since it uses as much as digits as its factorization.
211001000053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30, while the sum is 13.
Adding to 211001000053 its reverse (350000100112), we get a palindrome (561001100165).
The spelling of 211001000053 in words is "two hundred eleven billion, one million, fifty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •