Base | Representation |
---|---|
bin | 10000101010111… |
… | …00110000011101 |
3 | 100202010122011022 |
4 | 20111130300131 |
5 | 241244344131 |
6 | 21513133525 |
7 | 3315424241 |
oct | 1025346035 |
9 | 322118138 |
10 | 139840541 |
11 | 71a332a5 |
12 | 3a9ba2a5 |
13 | 22c828a9 |
14 | 14802421 |
15 | c42437b |
hex | 855cc1d |
139840541 has 2 divisors, whose sum is σ = 139840542. Its totient is φ = 139840540.
The previous prime is 139840489. The next prime is 139840543. The reversal of 139840541 is 145048931.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 119814916 + 20025625 = 10946^2 + 4475^2 .
It is a cyclic number.
It is not a de Polignac number, because 139840541 - 222 = 135646237 is a prime.
Together with 139840543, it forms a pair of twin primes.
It is a Chen prime.
It is equal to p7903691 and since 139840541 and 7903691 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (139840543) 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, 69920270 + 69920271.
It is an arithmetic number, because the mean of its divisors is an integer number (69920271).
Almost surely, 2139840541 is an apocalyptic number.
It is an amenable number.
139840541 is a deficient number, since it is larger than the sum of its proper divisors (1).
139840541 is an equidigital number, since it uses as much as digits as its factorization.
139840541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 35.
The square root of 139840541 is about 11825.4192737509. The cubic root of 139840541 is about 519.0521948341.
The spelling of 139840541 in words is "one hundred thirty-nine million, eight hundred forty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •