Base | Representation |
---|---|
bin | 101110011110100110100101… |
… | …011000111101100010000101 |
3 | 222210202201002010011010200012 |
4 | 232132212211120331202011 |
5 | 203243101114221141121 |
6 | 2002430034540400005 |
7 | 61025235332413052 |
oct | 5636464530754205 |
9 | 883681063133605 |
10 | 204413153302661 |
11 | 5a150149aaa286 |
12 | 1ab1477b546005 |
13 | 8a0a101781874 |
14 | 3869913d9a029 |
15 | 18973c6577c5b |
hex | b9e9a563d885 |
204413153302661 has 4 divisors (see below), whose sum is σ = 205883751528000. Its totient is φ = 202942555077324.
The previous prime is 204413153302573. The next prime is 204413153302663. The reversal of 204413153302661 is 166203351314402.
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 a de Polignac number, because none of the positive numbers 2k-204413153302661 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 (204413153302663) 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, 735299112461 + ... + 735299112738.
It is an arithmetic number, because the mean of its divisors is an integer number (51470937882000).
Almost surely, 2204413153302661 is an apocalyptic number.
It is an amenable number.
204413153302661 is a deficient number, since it is larger than the sum of its proper divisors (1470598225339).
204413153302661 is a wasteful number, since it uses less digits than its factorization.
204413153302661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1470598225338.
The product of its (nonzero) digits is 311040, while the sum is 41.
The spelling of 204413153302661 in words is "two hundred four trillion, four hundred thirteen billion, one hundred fifty-three million, three hundred two thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •