Base | Representation |
---|---|
bin | 11101001010111000100… |
… | …101001010100110101001 |
3 | 21002122002122022112111212 |
4 | 131022320211022212221 |
5 | 230320310141313231 |
6 | 4132513411402505 |
7 | 264552440463554 |
oct | 35127045124651 |
9 | 7078078275455 |
10 | 2004551510441 |
11 | 703142083a67 |
12 | 2845b42b3435 |
13 | 11704a50490c |
14 | 6d04116769b |
15 | 3722289342b |
hex | 1d2b894a9a9 |
2004551510441 has 8 divisors (see below), whose sum is σ = 2052554041824. Its totient is φ = 1956611936160.
The previous prime is 2004551510417. The next prime is 2004551510449. The reversal of 2004551510441 is 1440151554002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2004551510441 is a prime.
It is a super-2 number, since 2×20045515104412 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2004551510398 and 2004551510407.
It is not an unprimeable number, because it can be changed into a prime (2004551510449) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15674831 + ... + 15802196.
It is an arithmetic number, because the mean of its divisors is an integer number (256569255228).
Almost surely, 22004551510441 is an apocalyptic number.
It is an amenable number.
2004551510441 is a deficient number, since it is larger than the sum of its proper divisors (48002531383).
2004551510441 is a wasteful number, since it uses less digits than its factorization.
2004551510441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31478551.
The product of its (nonzero) digits is 16000, while the sum is 32.
The spelling of 2004551510441 in words is "two trillion, four billion, five hundred fifty-one million, five hundred ten thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •