Base | Representation |
---|---|
bin | 101110011001001110111001… |
… | …111110001000000100011101 |
3 | 222202110102120100100021010102 |
4 | 232121032321332020010131 |
5 | 203221024340114331023 |
6 | 2001544325132350445 |
7 | 60656462535125360 |
oct | 5631167176100435 |
9 | 882412510307112 |
10 | 204044131402013 |
11 | 5a0186a2836491 |
12 | 1aa75152915425 |
13 | 89b1382048236 |
14 | 3855b080cc0d7 |
15 | 188c9c95b0628 |
hex | b993b9f8811d |
204044131402013 has 8 divisors (see below), whose sum is σ = 233503803413760. Its totient is φ = 174662086986000.
The previous prime is 204044131402003. The next prime is 204044131402057. The reversal of 204044131402013 is 310204131440402.
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 204044131402013 - 24 = 204044131401997 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 (204044131402003) 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, 19406893298 + ... + 19406903811.
It is an arithmetic number, because the mean of its divisors is an integer number (29187975426720).
Almost surely, 2204044131402013 is an apocalyptic number.
It is an amenable number.
204044131402013 is a deficient number, since it is larger than the sum of its proper divisors (29459672011747).
204044131402013 is an equidigital number, since it uses as much as digits as its factorization.
204044131402013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38813797867.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 204044131402013 its reverse (310204131440402), we get a palindrome (514248262842415).
The spelling of 204044131402013 in words is "two hundred four trillion, forty-four billion, one hundred thirty-one million, four hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •