Base | Representation |
---|---|
bin | 1011111000011000011… |
… | …0001100010111111101 |
3 | 201111212000001120222101 |
4 | 2332012012030113331 |
5 | 11321010441432110 |
6 | 233433542545101 |
7 | 20514054600064 |
oct | 2760606142775 |
9 | 644760046871 |
10 | 204113233405 |
11 | 79622665354 |
12 | 33685138191 |
13 | 1632b5388b3 |
14 | 9c444ad1db |
15 | 549961513a |
hex | 2f8618c5fd |
204113233405 has 8 divisors (see below), whose sum is σ = 244961957592. Its totient is φ = 163273201728.
The previous prime is 204113233369. The next prime is 204113233409. The reversal of 204113233405 is 504332311402.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 55103337081 + 149009896324 = 234741^2 + 386018^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 204113233405 - 219 = 204112709117 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204113233409) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2121354 + ... + 2215483.
It is an arithmetic number, because the mean of its divisors is an integer number (30620244699).
Almost surely, 2204113233405 is an apocalyptic number.
It is an amenable number.
204113233405 is a deficient number, since it is larger than the sum of its proper divisors (40848724187).
204113233405 is an equidigital number, since it uses as much as digits as its factorization.
204113233405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4346255.
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 204113233405 its reverse (504332311402), we get a palindrome (708445544807).
The spelling of 204113233405 in words is "two hundred four billion, one hundred thirteen million, two hundred thirty-three thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •