Base | Representation |
---|---|
bin | 10010011111010… |
… | …10101110111001 |
3 | 101210212000010121 |
4 | 21033222232321 |
5 | 304201232022 |
6 | 23220213241 |
7 | 3562226551 |
oct | 1117525671 |
9 | 353760117 |
10 | 155102137 |
11 | 7a607593 |
12 | 43b3a221 |
13 | 26197318 |
14 | 16856161 |
15 | d93b2c7 |
hex | 93eabb9 |
155102137 has 2 divisors, whose sum is σ = 155102138. Its totient is φ = 155102136.
The previous prime is 155102117. The next prime is 155102153. The reversal of 155102137 is 731201551.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 154853136 + 249001 = 12444^2 + 499^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-155102137 is a prime.
It is a super-4 number, since 4×1551021374 (a number of 34 digits) contains 4444 as substring.
It is not a weakly prime, because it can be changed into another prime (155102117) 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, 77551068 + 77551069.
It is an arithmetic number, because the mean of its divisors is an integer number (77551069).
Almost surely, 2155102137 is an apocalyptic number.
It is an amenable number.
155102137 is a deficient number, since it is larger than the sum of its proper divisors (1).
155102137 is an equidigital number, since it uses as much as digits as its factorization.
155102137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1050, while the sum is 25.
The square root of 155102137 is about 12454.0008431026. Note that the first 3 decimals coincide. The cubic root of 155102137 is about 537.2864983678.
Adding to 155102137 its reverse (731201551), we get a palindrome (886303688).
The spelling of 155102137 in words is "one hundred fifty-five million, one hundred two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •