Base | Representation |
---|---|
bin | 101110011000111101100101… |
… | …010111001110101011010101 |
3 | 222202101122120010101021212222 |
4 | 232120331211113032223111 |
5 | 203220223242201101013 |
6 | 2001532011355552125 |
7 | 60655233611213603 |
oct | 5630754527165325 |
9 | 882348503337788 |
10 | 204025532050133 |
11 | 5a0108189a90a2 |
12 | 1aa71621a5b645 |
13 | 89ac6a98b8091 |
14 | 3854c61c46873 |
15 | 188c28b7b6508 |
hex | b98f655cead5 |
204025532050133 has 16 divisors (see below), whose sum is σ = 207210679955136. Its totient is φ = 200871320507520.
The previous prime is 204025532050127. The next prime is 204025532050199. The reversal of 204025532050133 is 331050235520402.
It is a cyclic number.
It is not a de Polignac number, because 204025532050133 - 26 = 204025532050069 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 204025532050093 and 204025532050102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204025532050033) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3610691 + ... + 20520432.
It is an arithmetic number, because the mean of its divisors is an integer number (12950667497196).
Almost surely, 2204025532050133 is an apocalyptic number.
It is an amenable number.
204025532050133 is a deficient number, since it is larger than the sum of its proper divisors (3185147905003).
204025532050133 is a wasteful number, since it uses less digits than its factorization.
204025532050133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24131764.
The product of its (nonzero) digits is 108000, while the sum is 35.
Adding to 204025532050133 its reverse (331050235520402), we get a palindrome (535075767570535).
The spelling of 204025532050133 in words is "two hundred four trillion, twenty-five billion, five hundred thirty-two million, fifty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •