Base | Representation |
---|---|
bin | 11000010100011… |
… | …01101100010101 |
3 | 112012212111001001 |
4 | 30022031230111 |
5 | 404211112432 |
6 | 32124303301 |
7 | 5025002122 |
oct | 1412155425 |
9 | 465774031 |
10 | 204004117 |
11 | a5178349 |
12 | 583a1b31 |
13 | 333599c5 |
14 | 1d145749 |
15 | 12d9a9e7 |
hex | c28db15 |
204004117 has 8 divisors (see below), whose sum is σ = 205754400. Its totient is φ = 202260240.
The previous prime is 204004093. The next prime is 204004127. The reversal of 204004117 is 711400402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 204004117 - 215 = 203971349 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 204004094 and 204004103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204004127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 78759 + ... + 81307.
It is an arithmetic number, because the mean of its divisors is an integer number (25719300).
Almost surely, 2204004117 is an apocalyptic number.
It is an amenable number.
204004117 is a deficient number, since it is larger than the sum of its proper divisors (1750283).
204004117 is a wasteful number, since it uses less digits than its factorization.
204004117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3203.
The product of its (nonzero) digits is 224, while the sum is 19.
The square root of 204004117 is about 14283.0009801862. Note that the first 3 decimals coincide. The cubic root of 204004117 is about 588.6804917618.
Adding to 204004117 its reverse (711400402), we get a palindrome (915404519).
The spelling of 204004117 in words is "two hundred four million, four thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •