Base | Representation |
---|---|
bin | 11101001010011001100… |
… | …100110111111110001101 |
3 | 21002120202101112011101212 |
4 | 131022121210313332031 |
5 | 230313224010343204 |
6 | 4132350030344205 |
7 | 264533523222116 |
oct | 35123144677615 |
9 | 7076671464355 |
10 | 2004031340429 |
11 | 7029a54a0598 |
12 | 28448a05b065 |
13 | 116c96809c01 |
14 | 6cdd204120d |
15 | 371e1d93c6e |
hex | 1d299937f8d |
2004031340429 has 2 divisors, whose sum is σ = 2004031340430. Its totient is φ = 2004031340428.
The previous prime is 2004031340413. The next prime is 2004031340459. The reversal of 2004031340429 is 9240431304002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1923486062404 + 80545278025 = 1386898^2 + 283805^2 .
It is a cyclic number.
It is not a de Polignac number, because 2004031340429 - 24 = 2004031340413 is a prime.
It is a super-2 number, since 2×20040313404292 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2004031340395 and 2004031340404.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2004031340459) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1002015670214 + 1002015670215.
It is an arithmetic number, because the mean of its divisors is an integer number (1002015670215).
Almost surely, 22004031340429 is an apocalyptic number.
It is an amenable number.
2004031340429 is a deficient number, since it is larger than the sum of its proper divisors (1).
2004031340429 is an equidigital number, since it uses as much as digits as its factorization.
2004031340429 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20736, while the sum is 32.
The spelling of 2004031340429 in words is "two trillion, four billion, thirty-one million, three hundred forty thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •