Base | Representation |
---|---|
bin | 1011111001000101110… |
… | …0001110110101110101 |
3 | 201112100021012012001111 |
4 | 2332101130032311311 |
5 | 11321403202410203 |
6 | 233504502155021 |
7 | 20521555415215 |
oct | 2762134166565 |
9 | 645307165044 |
10 | 204303560053 |
11 | 797100405aa |
12 | 33718a22a71 |
13 | 1635bab6c08 |
14 | 9c61894245 |
15 | 54ab1ad26d |
hex | 2f9170ed75 |
204303560053 has 4 divisors (see below), whose sum is σ = 204306727680. Its totient is φ = 204300392428.
The previous prime is 204303560009. The next prime is 204303560099. The reversal of 204303560053 is 350065303402.
It is a happy number.
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 a cyclic number.
It is not a de Polignac number, because 204303560053 - 217 = 204303428981 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 204303559997 and 204303560024.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204303560453) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1485013 + ... + 1616746.
It is an arithmetic number, because the mean of its divisors is an integer number (51076681920).
Almost surely, 2204303560053 is an apocalyptic number.
It is an amenable number.
204303560053 is a deficient number, since it is larger than the sum of its proper divisors (3167627).
204303560053 is an equidigital number, since it uses as much as digits as its factorization.
204303560053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3167626.
The product of its (nonzero) digits is 32400, while the sum is 31.
Adding to 204303560053 its reverse (350065303402), we get a palindrome (554368863455).
The spelling of 204303560053 in words is "two hundred four billion, three hundred three million, five hundred sixty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •