Base | Representation |
---|---|
bin | 11101101100000000101… |
… | …010011111010110000001 |
3 | 21020000220111211201002121 |
4 | 131230000222133112001 |
5 | 231411131333312113 |
6 | 4201115104444241 |
7 | 300252043004101 |
oct | 35540052372601 |
9 | 7200814751077 |
10 | 2040120604033 |
11 | 717234993486 |
12 | 28b480319681 |
13 | 11a4c85c2765 |
14 | 70a57093201 |
15 | 38105388e8d |
hex | 1db00a9f581 |
2040120604033 has 2 divisors, whose sum is σ = 2040120604034. Its totient is φ = 2040120604032.
The previous prime is 2040120604013. The next prime is 2040120604051. The reversal of 2040120604033 is 3304060210402.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1401706819969 + 638413784064 = 1183937^2 + 799008^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2040120604033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2040120603989 and 2040120604007.
It is not a weakly prime, because it can be changed into another prime (2040120604013) 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, 1020060302016 + 1020060302017.
It is an arithmetic number, because the mean of its divisors is an integer number (1020060302017).
Almost surely, 22040120604033 is an apocalyptic number.
It is an amenable number.
2040120604033 is a deficient number, since it is larger than the sum of its proper divisors (1).
2040120604033 is an equidigital number, since it uses as much as digits as its factorization.
2040120604033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 2040120604033 its reverse (3304060210402), we get a palindrome (5344180814435).
The spelling of 2040120604033 in words is "two trillion, forty billion, one hundred twenty million, six hundred four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •