Base | Representation |
---|---|
bin | 11100111100111… |
… | …100111001101011 |
3 | 1020212000011012112 |
4 | 130330330321223 |
5 | 1443322141024 |
6 | 120111032535 |
7 | 15015503003 |
oct | 3474747153 |
9 | 1225004175 |
10 | 485740139 |
11 | 22a207835 |
12 | 11680b74b |
13 | 79831601 |
14 | 48723003 |
15 | 2c99d00e |
hex | 1cf3ce6b |
485740139 has 2 divisors, whose sum is σ = 485740140. Its totient is φ = 485740138.
The previous prime is 485740127. The next prime is 485740141. The reversal of 485740139 is 931047584.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 485740139 - 216 = 485674603 is a prime.
Together with 485740141, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 485740096 and 485740105.
It is not a weakly prime, because it can be changed into another prime (485740109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 242870069 + 242870070.
It is an arithmetic number, because the mean of its divisors is an integer number (242870070).
Almost surely, 2485740139 is an apocalyptic number.
485740139 is a deficient number, since it is larger than the sum of its proper divisors (1).
485740139 is an equidigital number, since it uses as much as digits as its factorization.
485740139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120960, while the sum is 41.
The square root of 485740139 is about 22039.5131298312. The cubic root of 485740139 is about 786.0822639631.
The spelling of 485740139 in words is "four hundred eighty-five million, seven hundred forty thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •