Base | Representation |
---|---|
bin | 10110000100001… |
… | …01011111001001 |
3 | 110220021212011111 |
4 | 23002011133021 |
5 | 334341034022 |
6 | 30211130321 |
7 | 4405201612 |
oct | 1302053711 |
9 | 426255144 |
10 | 185096137 |
11 | 95533516 |
12 | 51ba39a1 |
13 | 2c469655 |
14 | 1a822c09 |
15 | 113b3477 |
hex | b0857c9 |
185096137 has 2 divisors, whose sum is σ = 185096138. Its totient is φ = 185096136.
The previous prime is 185096063. The next prime is 185096173. The reversal of 185096137 is 731690581.
Together with next prime (185096173) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 153859216 + 31236921 = 12404^2 + 5589^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-185096137 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 185096137.
It is not a weakly prime, because it can be changed into another prime (185093137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 92548068 + 92548069.
It is an arithmetic number, because the mean of its divisors is an integer number (92548069).
Almost surely, 2185096137 is an apocalyptic number.
It is an amenable number.
185096137 is a deficient number, since it is larger than the sum of its proper divisors (1).
185096137 is an equidigital number, since it uses as much as digits as its factorization.
185096137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360, while the sum is 40.
The square root of 185096137 is about 13605.0041161332. The cubic root of 185096137 is about 569.9006054247.
The spelling of 185096137 in words is "one hundred eighty-five million, ninety-six thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •