Base | Representation |
---|---|
bin | 11101101111000000001… |
… | …110010011110011101101 |
3 | 21020100012111020121021121 |
4 | 131233000032103303231 |
5 | 231434222104122341 |
6 | 4202410032300541 |
7 | 300424506120532 |
oct | 35570016236355 |
9 | 7210174217247 |
10 | 2043334442221 |
11 | 7186340286a6 |
12 | 2900186a1751 |
13 | 11a8bb397b67 |
14 | 70c7dc40d89 |
15 | 382425bc4d1 |
hex | 1dbc0393ced |
2043334442221 has 2 divisors, whose sum is σ = 2043334442222. Its totient is φ = 2043334442220.
The previous prime is 2043334442207. The next prime is 2043334442257. The reversal of 2043334442221 is 1222444333402.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1912373688996 + 130960753225 = 1382886^2 + 361885^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2043334442221 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2043334442021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1021667221110 + 1021667221111.
It is an arithmetic number, because the mean of its divisors is an integer number (1021667221111).
Almost surely, 22043334442221 is an apocalyptic number.
It is an amenable number.
2043334442221 is a deficient number, since it is larger than the sum of its proper divisors (1).
2043334442221 is an equidigital number, since it uses as much as digits as its factorization.
2043334442221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 110592, while the sum is 34.
Adding to 2043334442221 its reverse (1222444333402), we get a palindrome (3265778775623).
The spelling of 2043334442221 in words is "two trillion, forty-three billion, three hundred thirty-four million, four hundred forty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •