Base | Representation |
---|---|
bin | 1100010010000111001… |
… | …0010110100111111001 |
3 | 202011200100211011100001 |
4 | 3010201302112213321 |
5 | 11424132140323442 |
6 | 240535200113001 |
7 | 21150164330425 |
oct | 3044162264771 |
9 | 664610734301 |
10 | 211020245497 |
11 | 81547477806 |
12 | 34a92305761 |
13 | 16b8c4b48b9 |
14 | a2db941b85 |
15 | 5750bb22b7 |
hex | 3121c969f9 |
211020245497 has 2 divisors, whose sum is σ = 211020245498. Its totient is φ = 211020245496.
The previous prime is 211020245477. The next prime is 211020245503. The reversal of 211020245497 is 794542020112.
211020245497 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., 209650431376 + 1369814121 = 457876^2 + 37011^2 .
It is a cyclic number.
It is not a de Polignac number, because 211020245497 - 223 = 211011856889 is a prime.
It is a super-2 number, since 2×2110202454972 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (211020245477) 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, 105510122748 + 105510122749.
It is an arithmetic number, because the mean of its divisors is an integer number (105510122749).
Almost surely, 2211020245497 is an apocalyptic number.
It is an amenable number.
211020245497 is a deficient number, since it is larger than the sum of its proper divisors (1).
211020245497 is an equidigital number, since it uses as much as digits as its factorization.
211020245497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40320, while the sum is 37.
The spelling of 211020245497 in words is "two hundred eleven billion, twenty million, two hundred forty-five thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •