Base | Representation |
---|---|
bin | 1100011001101001101… |
… | …1001001100001000101 |
3 | 202100220102020222200201 |
4 | 3012122123021201011 |
5 | 11442303304040022 |
6 | 241512100410501 |
7 | 21251301604024 |
oct | 3063233114105 |
9 | 670812228621 |
10 | 213044205637 |
11 | 82395999a3a |
12 | 353580a6a31 |
13 | 171228caa53 |
14 | a4506768bb |
15 | 581d709127 |
hex | 319a6c9845 |
213044205637 has 2 divisors, whose sum is σ = 213044205638. Its totient is φ = 213044205636.
The previous prime is 213044205623. The next prime is 213044205641. The reversal of 213044205637 is 736502440312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 208415988676 + 4628216961 = 456526^2 + 68031^2 .
It is a cyclic number.
It is not a de Polignac number, because 213044205637 - 27 = 213044205509 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 213044205596 and 213044205605.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213044205607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106522102818 + 106522102819.
It is an arithmetic number, because the mean of its divisors is an integer number (106522102819).
Almost surely, 2213044205637 is an apocalyptic number.
It is an amenable number.
213044205637 is a deficient number, since it is larger than the sum of its proper divisors (1).
213044205637 is an equidigital number, since it uses as much as digits as its factorization.
213044205637 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120960, while the sum is 37.
Adding to 213044205637 its reverse (736502440312), we get a palindrome (949546645949).
The spelling of 213044205637 in words is "two hundred thirteen billion, forty-four million, two hundred five thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •