Base | Representation |
---|---|
bin | 11000011001001… |
… | …01000110111001 |
3 | 112021000222210021 |
4 | 30030211012321 |
5 | 404340434223 |
6 | 32145450441 |
7 | 5033164225 |
oct | 1414450671 |
9 | 467028707 |
10 | 204624313 |
11 | a5561303 |
12 | 58640a21 |
13 | 3351609a |
14 | 1d267785 |
15 | 12e6e65d |
hex | c3251b9 |
204624313 has 8 divisors (see below), whose sum is σ = 207181800. Its totient is φ = 202076160.
The previous prime is 204624293. The next prime is 204624341. The reversal of 204624313 is 313426402.
It can be written as a sum of positive squares in 4 ways, for example, as 3069504 + 201554809 = 1752^2 + 14197^2 .
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 204624313 - 221 = 202527161 is a prime.
It is a super-2 number, since 2×2046243132 = 83742218941443938, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (204604313) 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, 48513 + ... + 52561.
It is an arithmetic number, because the mean of its divisors is an integer number (25897725).
Almost surely, 2204624313 is an apocalyptic number.
It is an amenable number.
204624313 is a deficient number, since it is larger than the sum of its proper divisors (2557487).
204624313 is an equidigital number, since it uses as much as digits as its factorization.
204624313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4667.
The product of its (nonzero) digits is 3456, while the sum is 25.
The square root of 204624313 is about 14304.6954878459. The cubic root of 204624313 is about 589.2764404057.
The spelling of 204624313 in words is "two hundred four million, six hundred twenty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •