Base | Representation |
---|---|
bin | 10000010110011… |
… | …00000001010111 |
3 | 100120001222012001 |
4 | 20023030001113 |
5 | 240102304201 |
6 | 21335340131 |
7 | 3253521556 |
oct | 1013140127 |
9 | 316058161 |
10 | 137150551 |
11 | 7046626a |
12 | 39b21647 |
13 | 22550395 |
14 | 14301d9d |
15 | c092301 |
hex | 82cc057 |
137150551 has 2 divisors, whose sum is σ = 137150552. Its totient is φ = 137150550.
The previous prime is 137150537. The next prime is 137150561. The reversal of 137150551 is 155051731.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 137150551 - 27 = 137150423 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (137150501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68575275 + 68575276.
It is an arithmetic number, because the mean of its divisors is an integer number (68575276).
Almost surely, 2137150551 is an apocalyptic number.
137150551 is a deficient number, since it is larger than the sum of its proper divisors (1).
137150551 is an equidigital number, since it uses as much as digits as its factorization.
137150551 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2625, while the sum is 28.
The square root of 137150551 is about 11711.1293648392. The cubic root of 137150551 is about 515.7024392097.
The spelling of 137150551 in words is "one hundred thirty-seven million, one hundred fifty thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •