Base | Representation |
---|---|
bin | 10000011000000… |
… | …01100110101101 |
3 | 100120111010020212 |
4 | 20030001212231 |
5 | 240131320104 |
6 | 21344152205 |
7 | 3255424466 |
oct | 1014014655 |
9 | 316433225 |
10 | 137370029 |
11 | 705a6155 |
12 | 3a008665 |
13 | 225c9254 |
14 | 1435bd6d |
15 | c0d736e |
hex | 83019ad |
137370029 has 2 divisors, whose sum is σ = 137370030. Its totient is φ = 137370028.
The previous prime is 137369989. The next prime is 137370059. The reversal of 137370029 is 920073731.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 81090025 + 56280004 = 9005^2 + 7502^2 .
It is an emirp because it is prime and its reverse (920073731) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-137370029 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 137369977 and 137370004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (137370059) 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, 68685014 + 68685015.
It is an arithmetic number, because the mean of its divisors is an integer number (68685015).
Almost surely, 2137370029 is an apocalyptic number.
It is an amenable number.
137370029 is a deficient number, since it is larger than the sum of its proper divisors (1).
137370029 is an equidigital number, since it uses as much as digits as its factorization.
137370029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7938, while the sum is 32.
The square root of 137370029 is about 11720.4961072473. The cubic root of 137370029 is about 515.9773804258.
The spelling of 137370029 in words is "one hundred thirty-seven million, three hundred seventy thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •