Base | Representation |
---|---|
bin | 1011111001111000001… |
… | …1111111101101011001 |
3 | 201112220000122012221212 |
4 | 2332132003333231121 |
5 | 11322321404413200 |
6 | 233541504512505 |
7 | 20530036312226 |
oct | 2763603775531 |
9 | 645800565855 |
10 | 204515310425 |
11 | 79809619808 |
12 | 3377791b735 |
13 | 163939266aa |
14 | 9c81a5494d |
15 | 54bea89035 |
hex | 2f9e0ffb59 |
204515310425 has 12 divisors (see below), whose sum is σ = 255595831296. Its totient is φ = 162323960400.
The previous prime is 204515310403. The next prime is 204515310431. The reversal of 204515310425 is 524013515402.
It is not a de Polignac number, because 204515310425 - 214 = 204515294041 is a prime.
It is a super-2 number, since 2×2045153104252 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 204515310391 and 204515310400.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 32203961 + ... + 32210310.
It is an arithmetic number, because the mean of its divisors is an integer number (21299652608).
Almost surely, 2204515310425 is an apocalyptic number.
204515310425 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
204515310425 is a deficient number, since it is larger than the sum of its proper divisors (51080520871).
204515310425 is a wasteful number, since it uses less digits than its factorization.
204515310425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64414408 (or 64414403 counting only the distinct ones).
The product of its (nonzero) digits is 24000, while the sum is 32.
Adding to 204515310425 its reverse (524013515402), we get a palindrome (728528825827).
The spelling of 204515310425 in words is "two hundred four billion, five hundred fifteen million, three hundred ten thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •