Base | Representation |
---|---|
bin | 11000011111001… |
… | …00111101101101 |
3 | 112022111220202121 |
4 | 30033210331231 |
5 | 410041111112 |
6 | 32214352541 |
7 | 5042646301 |
oct | 1417447555 |
9 | 468456677 |
10 | 205410157 |
11 | a5a48767 |
12 | 5895b751 |
13 | 3372c994 |
14 | 1d3cdd01 |
15 | 13077407 |
hex | c3e4f6d |
205410157 has 8 divisors (see below), whose sum is σ = 207997560. Its totient is φ = 202836480.
The previous prime is 205410151. The next prime is 205410187. The reversal of 205410157 is 751014502.
It can be written as a sum of positive squares in 4 ways, for example, as 3031081 + 202379076 = 1741^2 + 14226^2 .
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 205410157 - 219 = 204885869 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 (205410151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28519 + ... + 34987.
It is an arithmetic number, because the mean of its divisors is an integer number (25999695).
Almost surely, 2205410157 is an apocalyptic number.
It is an amenable number.
205410157 is a deficient number, since it is larger than the sum of its proper divisors (2587403).
205410157 is a wasteful number, since it uses less digits than its factorization.
205410157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6863.
The product of its (nonzero) digits is 1400, while the sum is 25.
The square root of 205410157 is about 14332.1372097814. The cubic root of 205410157 is about 590.0298337878.
Adding to 205410157 its reverse (751014502), we get a palindrome (956424659).
The spelling of 205410157 in words is "two hundred five million, four hundred ten thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.087 sec. • engine limits •