Base | Representation |
---|---|
bin | 11000010111000… |
… | …00000010110110 |
3 | 112020111121202010 |
4 | 30023200002312 |
5 | 404302411210 |
6 | 32135425050 |
7 | 5030605416 |
oct | 1413400266 |
9 | 466447663 |
10 | 204341430 |
11 | a5388817 |
12 | 58525186 |
13 | 334473b7 |
14 | 1d1d2646 |
15 | 12e15920 |
hex | c2e00b6 |
204341430 has 64 divisors (see below), whose sum is σ = 522713088. Its totient is φ = 51004800.
The previous prime is 204341387. The next prime is 204341441. The reversal of 204341430 is 34143402.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 204341397 and 204341406.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 29280 + ... + 35580.
It is an arithmetic number, because the mean of its divisors is an integer number (8167392).
Almost surely, 2204341430 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 204341430, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (261356544).
204341430 is an abundant number, since it is smaller than the sum of its proper divisors (318371658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204341430 is a wasteful number, since it uses less digits than its factorization.
204341430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6381.
The product of its (nonzero) digits is 1152, while the sum is 21.
The square root of 204341430 is about 14294.8043008640. The cubic root of 204341430 is about 589.0047666566.
Adding to 204341430 its reverse (34143402), we get a palindrome (238484832).
The spelling of 204341430 in words is "two hundred four million, three hundred forty-one thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •