Base | Representation |
---|---|
bin | 11101001010100001110… |
… | …001000011001001010101 |
3 | 21002121002222002021102101 |
4 | 131022201301003021111 |
5 | 230314014144442103 |
6 | 4132411415442101 |
7 | 264540112202110 |
oct | 35124161031125 |
9 | 7077088067371 |
10 | 2004168749653 |
11 | 702a66013134 |
12 | 284508086331 |
13 | 116cb911ac45 |
14 | 6d0063ad577 |
15 | 371ede87a1d |
hex | 1d2a1c43255 |
2004168749653 has 8 divisors (see below), whose sum is σ = 2301988515200. Its totient is φ = 1709226470160.
The previous prime is 2004168749581. The next prime is 2004168749657. The reversal of 2004168749653 is 3569478614002.
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-2004168749653 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2004168749594 and 2004168749603.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2004168749657) 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, 719370018 + ... + 719372803.
It is an arithmetic number, because the mean of its divisors is an integer number (287748564400).
It is a 1-persistent number, because it is pandigital, but 2⋅2004168749653 = 4008337499306 is not.
Almost surely, 22004168749653 is an apocalyptic number.
It is an amenable number.
2004168749653 is a deficient number, since it is larger than the sum of its proper divisors (297819765547).
2004168749653 is a wasteful number, since it uses less digits than its factorization.
2004168749653 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1438743027.
The product of its (nonzero) digits is 8709120, while the sum is 55.
The spelling of 2004168749653 in words is "two trillion, four billion, one hundred sixty-eight million, seven hundred forty-nine thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •