Base | Representation |
---|---|
bin | 1011111000010101101… |
… | …0101100101000111111 |
3 | 201111211012121022010122 |
4 | 2332011122230220333 |
5 | 11321000032044411 |
6 | 233432454325155 |
7 | 20513555640434 |
oct | 2760532545077 |
9 | 644735538118 |
10 | 204101831231 |
11 | 79617187771 |
12 | 336813597bb |
13 | 16329075a4c |
14 | 9c42b81b8b |
15 | 54986119db |
hex | 2f856aca3f |
204101831231 has 8 divisors (see below), whose sum is σ = 206129838720. Its totient is φ = 202074716952.
The previous prime is 204101831177. The next prime is 204101831299. The reversal of 204101831231 is 132138101402.
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 204101831231 - 222 = 204097636927 is a prime.
It is a super-2 number, since 2×2041018312312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 204101831231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204101831831) 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, 240740 + ... + 682758.
It is an arithmetic number, because the mean of its divisors is an integer number (25766229840).
Almost surely, 2204101831231 is an apocalyptic number.
204101831231 is a deficient number, since it is larger than the sum of its proper divisors (2028007489).
204101831231 is a wasteful number, since it uses less digits than its factorization.
204101831231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 446605.
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 204101831231 its reverse (132138101402), we get a palindrome (336239932633).
The spelling of 204101831231 in words is "two hundred four billion, one hundred one million, eight hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •