Base | Representation |
---|---|
bin | 1011111000110100011… |
… | …1011111011011101101 |
3 | 201112011012200110202021 |
4 | 2332031013133123231 |
5 | 11321231114423000 |
6 | 233453351230141 |
7 | 20520014656105 |
oct | 2761507373355 |
9 | 645135613667 |
10 | 204231014125 |
11 | 796830a0796 |
12 | 336b8678351 |
13 | 16349a66628 |
14 | 9c55dac205 |
15 | 54a4b2d11a |
hex | 2f8d1df6ed |
204231014125 has 32 divisors (see below), whose sum is σ = 260345644416. Its totient is φ = 159915600000.
The previous prime is 204231014111. The next prime is 204231014131. The reversal of 204231014125 is 521410132402.
It is not a de Polignac number, because 204231014125 - 27 = 204231013997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
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 204231014125.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1109950 + ... + 1280800.
It is an arithmetic number, because the mean of its divisors is an integer number (8135801388).
Almost surely, 2204231014125 is an apocalyptic number.
204231014125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
204231014125 is a deficient number, since it is larger than the sum of its proper divisors (56114630291).
204231014125 is a wasteful number, since it uses less digits than its factorization.
204231014125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171070 (or 171060 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 25.
Adding to 204231014125 its reverse (521410132402), we get a palindrome (725641146527).
The spelling of 204231014125 in words is "two hundred four billion, two hundred thirty-one million, fourteen thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •