Base | Representation |
---|---|
bin | 11000010111011… |
… | …11011001101011 |
3 | 112020121211000210 |
4 | 30023233121223 |
5 | 404311414311 |
6 | 32141032203 |
7 | 5031256665 |
oct | 1413573153 |
9 | 466554023 |
10 | 204404331 |
11 | a5420aaa |
12 | 58555663 |
13 | 33469c11 |
14 | 1d20b535 |
15 | 12e293a6 |
hex | c2ef66b |
204404331 has 4 divisors (see below), whose sum is σ = 272539112. Its totient is φ = 136269552.
The previous prime is 204404303. The next prime is 204404339. The reversal of 204404331 is 133404402.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 204404331 - 210 = 204403307 is a prime.
It is a super-2 number, since 2×2044043312 = 83562261063115122, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 204404298 and 204404307.
It is not an unprimeable number, because it can be changed into a prime (204404339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 34067386 + ... + 34067391.
It is an arithmetic number, because the mean of its divisors is an integer number (68134778).
Almost surely, 2204404331 is an apocalyptic number.
204404331 is a deficient number, since it is larger than the sum of its proper divisors (68134781).
204404331 is an equidigital number, since it uses as much as digits as its factorization.
204404331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68134780.
The product of its (nonzero) digits is 1152, while the sum is 21.
The square root of 204404331 is about 14297.0042666287. The cubic root of 204404331 is about 589.0651968689.
Adding to 204404331 its reverse (133404402), we get a palindrome (337808733).
The spelling of 204404331 in words is "two hundred four million, four hundred four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •