Base | Representation |
---|---|
bin | 11000011000001… |
… | …11000000100111 |
3 | 112020210201200021 |
4 | 30030013000213 |
5 | 404323013111 |
6 | 32143100011 |
7 | 5032141630 |
oct | 1414070047 |
9 | 466721607 |
10 | 204501031 |
11 | a5487719 |
12 | 585a1607 |
13 | 334a1c37 |
14 | 1d234887 |
15 | 12e47d71 |
hex | c307027 |
204501031 has 8 divisors (see below), whose sum is σ = 233824640. Its totient is φ = 175204728.
The previous prime is 204501023. The next prime is 204501053. The reversal of 204501031 is 130105402.
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 204501031 - 23 = 204501023 is a prime.
It is a super-2 number, since 2×2045010312 = 83641343360125922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 204500996 and 204501014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204501001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13120 + ... + 24106.
It is an arithmetic number, because the mean of its divisors is an integer number (29228080).
Almost surely, 2204501031 is an apocalyptic number.
204501031 is a deficient number, since it is larger than the sum of its proper divisors (29323609).
204501031 is a wasteful number, since it uses less digits than its factorization.
204501031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13653.
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 204501031 is about 14300.3856940993. The cubic root of 204501031 is about 589.1580742620.
Adding to 204501031 its reverse (130105402), we get a palindrome (334606433).
The spelling of 204501031 in words is "two hundred four million, five hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •