Base | Representation |
---|---|
bin | 110000000010111101111110… |
… | …000001000011000011001101 |
3 | 1000201012001120212111122121111 |
4 | 300002331332001003003031 |
5 | 210144101302302343012 |
6 | 2025230323114132021 |
7 | 62336441665633654 |
oct | 6002757601030315 |
9 | 1021161525448544 |
10 | 211310210199757 |
11 | 6136a17a8a2779 |
12 | 1b849401a21011 |
13 | 90ba60c917a46 |
14 | 3a2767c33a19b |
15 | 19669e4486ba7 |
hex | c02f7e0430cd |
211310210199757 has 2 divisors, whose sum is σ = 211310210199758. Its totient is φ = 211310210199756.
The previous prime is 211310210199743. The next prime is 211310210199769. The reversal of 211310210199757 is 757991012013112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 128348370860836 + 82961839338921 = 11329094^2 + 9108339^2 .
It is a cyclic number.
It is not a de Polignac number, because 211310210199757 - 227 = 211310075982029 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 211310210199757.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211310210799757) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105655105099878 + 105655105099879.
It is an arithmetic number, because the mean of its divisors is an integer number (105655105099879).
Almost surely, 2211310210199757 is an apocalyptic number.
It is an amenable number.
211310210199757 is a deficient number, since it is larger than the sum of its proper divisors (1).
211310210199757 is an equidigital number, since it uses as much as digits as its factorization.
211310210199757 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 238140, while the sum is 49.
The spelling of 211310210199757 in words is "two hundred eleven trillion, three hundred ten billion, two hundred ten million, one hundred ninety-nine thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •