Base | Representation |
---|---|
bin | 10000011001000… |
… | …00000110100101 |
3 | 100120201110121112 |
4 | 20030200012211 |
5 | 240144314244 |
6 | 21350554405 |
7 | 3256454624 |
oct | 1014400645 |
9 | 316643545 |
10 | 137494949 |
11 | 70680a99 |
12 | 3a068a05 |
13 | 22641077 |
14 | 143916bb |
15 | c10e39e |
hex | 83201a5 |
137494949 has 2 divisors, whose sum is σ = 137494950. Its totient is φ = 137494948.
The previous prime is 137494939. The next prime is 137494961. The reversal of 137494949 is 949494731.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 116856100 + 20638849 = 10810^2 + 4543^2 .
It is an emirp because it is prime and its reverse (949494731) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 137494949 - 224 = 120717733 is a prime.
It is a super-2 number, since 2×1374949492 = 37809722001025202, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 137494897 and 137494906.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (137494919) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68747474 + 68747475.
It is an arithmetic number, because the mean of its divisors is an integer number (68747475).
Almost surely, 2137494949 is an apocalyptic number.
It is an amenable number.
137494949 is a deficient number, since it is larger than the sum of its proper divisors (1).
137494949 is an equidigital number, since it uses as much as digits as its factorization.
137494949 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 979776, while the sum is 50.
The square root of 137494949 is about 11725.8240222169. The cubic root of 137494949 is about 516.1337375940.
The spelling of 137494949 in words is "one hundred thirty-seven million, four hundred ninety-four thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •