Base | Representation |
---|---|
bin | 10000011000101… |
… | …01011110101101 |
3 | 100120122020220222 |
4 | 20030111132231 |
5 | 240141421222 |
6 | 21350021125 |
7 | 3256214024 |
oct | 1014253655 |
9 | 316566828 |
10 | 137451437 |
11 | 70651332 |
12 | 3a0477a5 |
13 | 22627316 |
14 | 1437d8bb |
15 | c101542 |
hex | 83157ad |
137451437 has 2 divisors, whose sum is σ = 137451438. Its totient is φ = 137451436.
The previous prime is 137451397. The next prime is 137451449. The reversal of 137451437 is 734154731.
137451437 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 135745801 + 1705636 = 11651^2 + 1306^2 .
It is an emirp because it is prime and its reverse (734154731) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 137451437 - 210 = 137450413 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 137451397 and 137451406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (137451497) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68725718 + 68725719.
It is an arithmetic number, because the mean of its divisors is an integer number (68725719).
Almost surely, 2137451437 is an apocalyptic number.
It is an amenable number.
137451437 is a deficient number, since it is larger than the sum of its proper divisors (1).
137451437 is an equidigital number, since it uses as much as digits as its factorization.
137451437 is an evil number, because the sum of its binary digits is even.
The product of its digits is 35280, while the sum is 35.
The square root of 137451437 is about 11723.9684834104. The cubic root of 137451437 is about 516.0792861861.
The spelling of 137451437 in words is "one hundred thirty-seven million, four hundred fifty-one thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •