Base | Representation |
---|---|
bin | 10000010101100… |
… | …01010111010001 |
3 | 100112212102101222 |
4 | 20022301113101 |
5 | 240040310421 |
6 | 21333134425 |
7 | 3252555332 |
oct | 1012612721 |
9 | 315772358 |
10 | 137041361 |
11 | 703a1226 |
12 | 39a8a415 |
13 | 22512782 |
14 | 142b4289 |
15 | c06ecab |
hex | 82b15d1 |
137041361 has 2 divisors, whose sum is σ = 137041362. Its totient is φ = 137041360.
The previous prime is 137041321. The next prime is 137041363. The reversal of 137041361 is 163140731.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 130965136 + 6076225 = 11444^2 + 2465^2 .
It is a cyclic number.
It is not a de Polignac number, because 137041361 - 218 = 136779217 is a prime.
It is a Sophie Germain prime.
Together with 137041363, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 137041361.
It is not a weakly prime, because it can be changed into another prime (137041363) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68520680 + 68520681.
It is an arithmetic number, because the mean of its divisors is an integer number (68520681).
Almost surely, 2137041361 is an apocalyptic number.
It is an amenable number.
137041361 is a deficient number, since it is larger than the sum of its proper divisors (1).
137041361 is an equidigital number, since it uses as much as digits as its factorization.
137041361 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1512, while the sum is 26.
The square root of 137041361 is about 11706.4666317382. The cubic root of 137041361 is about 515.5655470650.
The spelling of 137041361 in words is "one hundred thirty-seven million, forty-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •