Base | Representation |
---|---|
bin | 11101001010101111101… |
… | …100011011100110100011 |
3 | 21002121201020202222001112 |
4 | 131022233230123212203 |
5 | 230320004004421011 |
6 | 4132450524053535 |
7 | 264545650313126 |
oct | 35125754334643 |
9 | 7077636688045 |
10 | 2004402420131 |
11 | 703075a03231 |
12 | 2845723942ab |
13 | 117025663ab7 |
14 | 6d0294383bd |
15 | 3721474358b |
hex | 1d2afb1b9a3 |
2004402420131 has 4 divisors (see below), whose sum is σ = 2004550065912. Its totient is φ = 2004254774352.
The previous prime is 2004402420103. The next prime is 2004402420227. The reversal of 2004402420131 is 1310242044002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2004402420131 - 226 = 2004335311267 is a prime.
It is a super-2 number, since 2×20044024201312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2004402420097 and 2004402420106.
It is not an unprimeable number, because it can be changed into a prime (2004402420101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 73802525 + ... + 73829678.
It is an arithmetic number, because the mean of its divisors is an integer number (501137516478).
Almost surely, 22004402420131 is an apocalyptic number.
2004402420131 is a deficient number, since it is larger than the sum of its proper divisors (147645781).
2004402420131 is a wasteful number, since it uses less digits than its factorization.
2004402420131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147645780.
The product of its (nonzero) digits is 1536, while the sum is 23.
Adding to 2004402420131 its reverse (1310242044002), we get a palindrome (3314644464133).
The spelling of 2004402420131 in words is "two trillion, four billion, four hundred two million, four hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •