Base | Representation |
---|---|
bin | 1011111000110111110… |
… | …1010100011111110111 |
3 | 201112012012020101101101 |
4 | 2332031331110133313 |
5 | 11321243223000421 |
6 | 233455013510531 |
7 | 20520245630026 |
oct | 2761575243767 |
9 | 645165211341 |
10 | 204245125111 |
11 | 79690059565 |
12 | 33701342447 |
13 | 1634c967421 |
14 | 9c57c028bd |
15 | 54a5eb9191 |
hex | 2f8df547f7 |
204245125111 has 4 divisors (see below), whose sum is σ = 204357907224. Its totient is φ = 204132343000.
The previous prime is 204245125103. The next prime is 204245125127. The reversal of 204245125111 is 111521542402.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 204245125111 - 23 = 204245125103 is a prime.
It is a super-2 number, since 2×2042451251112 (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 204245125111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204245225111) 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, 56388340 + ... + 56391961.
It is an arithmetic number, because the mean of its divisors is an integer number (51089476806).
Almost surely, 2204245125111 is an apocalyptic number.
204245125111 is a deficient number, since it is larger than the sum of its proper divisors (112782113).
204245125111 is a wasteful number, since it uses less digits than its factorization.
204245125111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 112782112.
The product of its (nonzero) digits is 3200, while the sum is 28.
Adding to 204245125111 its reverse (111521542402), we get a palindrome (315766667513).
The spelling of 204245125111 in words is "two hundred four billion, two hundred forty-five million, one hundred twenty-five thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •