Base | Representation |
---|---|
bin | 11101001010011110111… |
… | …100000111110001010101 |
3 | 21002120222122211121220022 |
4 | 131022132330013301111 |
5 | 230313420024224113 |
6 | 4132403003114525 |
7 | 264535665102563 |
oct | 35123674076125 |
9 | 7076878747808 |
10 | 2004121320533 |
11 | 702a41268a12 |
12 | 2844b4212a45 |
13 | 116cac352a87 |
14 | 6cdddd84a33 |
15 | 371e9c19908 |
hex | 1d29ef07c55 |
2004121320533 has 2 divisors, whose sum is σ = 2004121320534. Its totient is φ = 2004121320532.
The previous prime is 2004121320521. The next prime is 2004121320541. The reversal of 2004121320533 is 3350231214002.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1379645223889 + 624476096644 = 1174583^2 + 790238^2 .
It is a cyclic number.
It is not a de Polignac number, because 2004121320533 - 210 = 2004121319509 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2004121220533) 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, 1002060660266 + 1002060660267.
It is an arithmetic number, because the mean of its divisors is an integer number (1002060660267).
Almost surely, 22004121320533 is an apocalyptic number.
It is an amenable number.
2004121320533 is a deficient number, since it is larger than the sum of its proper divisors (1).
2004121320533 is an equidigital number, since it uses as much as digits as its factorization.
2004121320533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 26.
Adding to 2004121320533 its reverse (3350231214002), we get a palindrome (5354352534535).
The spelling of 2004121320533 in words is "two trillion, four billion, one hundred twenty-one million, three hundred twenty thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •