Base | Representation |
---|---|
bin | 1011111001010010000… |
… | …0011110111011111101 |
3 | 201112110211222220220112 |
4 | 2332110200132323331 |
5 | 11322004340144310 |
6 | 233513540555405 |
7 | 20523051615050 |
oct | 2762440367375 |
9 | 645424886815 |
10 | 204355006205 |
11 | 79737089889 |
12 | 337320b2b65 |
13 | 1636965a61c |
14 | 9c68646a97 |
15 | 54b0971705 |
hex | 2f9481eefd |
204355006205 has 8 divisors (see below), whose sum is σ = 280258294272. Its totient is φ = 140129147088.
The previous prime is 204355006201. The next prime is 204355006267. The reversal of 204355006205 is 502600553402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 204355006205 - 22 = 204355006201 is a prime.
It is a super-2 number, since 2×2043550062052 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204355006201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2919357197 + ... + 2919357266.
It is an arithmetic number, because the mean of its divisors is an integer number (35032286784).
Almost surely, 2204355006205 is an apocalyptic number.
It is an amenable number.
204355006205 is a deficient number, since it is larger than the sum of its proper divisors (75903288067).
204355006205 is an equidigital number, since it uses as much as digits as its factorization.
204355006205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5838714475.
The product of its (nonzero) digits is 36000, while the sum is 32.
Adding to 204355006205 its reverse (502600553402), we get a palindrome (706955559607).
The spelling of 204355006205 in words is "two hundred four billion, three hundred fifty-five million, six thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.168 sec. • engine limits •