Base | Representation |
---|---|
bin | 10000011000111… |
… | …10110010000001 |
3 | 100120201012012002 |
4 | 20030132302001 |
5 | 240144131122 |
6 | 21350513345 |
7 | 3256433063 |
oct | 1014366201 |
9 | 316635162 |
10 | 137489537 |
11 | 70677a19 |
12 | 3a065855 |
13 | 2263b773 |
14 | 1438d733 |
15 | c10c992 |
hex | 831ec81 |
137489537 has 2 divisors, whose sum is σ = 137489538. Its totient is φ = 137489536.
The previous prime is 137489519. The next prime is 137489549. The reversal of 137489537 is 735984731.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 93876721 + 43612816 = 9689^2 + 6604^2 .
It is a cyclic number.
It is not a de Polignac number, because 137489537 - 222 = 133295233 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 137489491 and 137489500.
It is not a weakly prime, because it can be changed into another prime (137489137) 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, 68744768 + 68744769.
It is an arithmetic number, because the mean of its divisors is an integer number (68744769).
Almost surely, 2137489537 is an apocalyptic number.
It is an amenable number.
137489537 is a deficient number, since it is larger than the sum of its proper divisors (1).
137489537 is an equidigital number, since it uses as much as digits as its factorization.
137489537 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 635040, while the sum is 47.
The square root of 137489537 is about 11725.5932472519. The cubic root of 137489537 is about 516.1269655817.
The spelling of 137489537 in words is "one hundred thirty-seven million, four hundred eighty-nine thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •