Base | Representation |
---|---|
bin | 10000011000001… |
… | …01110110111001 |
3 | 100120112000011001 |
4 | 20030011312321 |
5 | 240132344244 |
6 | 21344405001 |
7 | 3255526333 |
oct | 1014056671 |
9 | 316460131 |
10 | 137387449 |
11 | 70608251 |
12 | 3a016761 |
13 | 22604164 |
14 | 14364453 |
15 | c0dc5d4 |
hex | 8305db9 |
137387449 has 2 divisors, whose sum is σ = 137387450. Its totient is φ = 137387448.
The previous prime is 137387417. The next prime is 137387473. The reversal of 137387449 is 944783731.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 127351225 + 10036224 = 11285^2 + 3168^2 .
It is a cyclic number.
It is not a de Polignac number, because 137387449 - 25 = 137387417 is a prime.
It is a super-2 number, since 2×1373874492 = 37750622285455202, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 137387399 and 137387408.
It is not a weakly prime, because it can be changed into another prime (137387479) 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, 68693724 + 68693725.
It is an arithmetic number, because the mean of its divisors is an integer number (68693725).
Almost surely, 2137387449 is an apocalyptic number.
It is an amenable number.
137387449 is a deficient number, since it is larger than the sum of its proper divisors (1).
137387449 is an equidigital number, since it uses as much as digits as its factorization.
137387449 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 508032, while the sum is 46.
The square root of 137387449 is about 11721.2392262934. The cubic root of 137387449 is about 515.9991900013. Note that the first 3 decimals are identical.
The spelling of 137387449 in words is "one hundred thirty-seven million, three hundred eighty-seven thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •