Base | Representation |
---|---|
bin | 11000010111000… |
… | …00111010101001 |
3 | 112020111210122101 |
4 | 30023200322221 |
5 | 404303020001 |
6 | 32135453401 |
7 | 5030622010 |
oct | 1413407251 |
9 | 466453571 |
10 | 204345001 |
11 | a5390473 |
12 | 58527261 |
13 | 33448c03 |
14 | 1d1d3a77 |
15 | 12e16a01 |
hex | c2e0ea9 |
204345001 has 4 divisors (see below), whose sum is σ = 233537152. Its totient is φ = 175152852.
The previous prime is 204344999. The next prime is 204345013. The reversal of 204345001 is 100543402.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 204345001 - 21 = 204344999 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 204345001.
It is not an unprimeable number, because it can be changed into a prime (204345091) 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 3 ways as a sum of consecutive naturals, for example, 14596065 + ... + 14596078.
It is an arithmetic number, because the mean of its divisors is an integer number (58384288).
Almost surely, 2204345001 is an apocalyptic number.
It is an amenable number.
204345001 is a deficient number, since it is larger than the sum of its proper divisors (29192151).
204345001 is an equidigital number, since it uses as much as digits as its factorization.
204345001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29192150.
The product of its (nonzero) digits is 480, while the sum is 19.
The square root of 204345001 is about 14294.9292058408. The cubic root of 204345001 is about 589.0081977177.
Adding to 204345001 its reverse (100543402), we get a palindrome (304888403).
The spelling of 204345001 in words is "two hundred four million, three hundred forty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •