Base | Representation |
---|---|
bin | 11000010101100… |
… | …11111001110111 |
3 | 112020011102201212 |
4 | 30022303321313 |
5 | 404231120011 |
6 | 32131512035 |
7 | 5026223333 |
oct | 1412637167 |
9 | 466142655 |
10 | 204160631 |
11 | a52749a4 |
12 | 5845861b |
13 | 333b300c |
14 | 1d1867c3 |
15 | 12dcc08b |
hex | c2b3e77 |
204160631 has 2 divisors, whose sum is σ = 204160632. Its totient is φ = 204160630.
The previous prime is 204160613. The next prime is 204160687. The reversal of 204160631 is 136061402.
It is a happy number.
Together with previous prime (204160613) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-204160631 is a prime.
It is a super-2 number, since 2×2041606312 = 83363126500636322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 204160597 and 204160606.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (204160331) 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 as a sum of consecutive naturals, namely, 102080315 + 102080316.
It is an arithmetic number, because the mean of its divisors is an integer number (102080316).
Almost surely, 2204160631 is an apocalyptic number.
204160631 is a deficient number, since it is larger than the sum of its proper divisors (1).
204160631 is an equidigital number, since it uses as much as digits as its factorization.
204160631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
The square root of 204160631 is about 14288.4789603372. The cubic root of 204160631 is about 588.8310004658.
The spelling of 204160631 in words is "two hundred four million, one hundred sixty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •