Base | Representation |
---|---|
bin | 101100101010110100… |
… | …1011100111001011011 |
3 | 100011121021002101010202 |
4 | 1121111221130321123 |
5 | 3032424102211024 |
6 | 112022355332415 |
7 | 6634066222064 |
oct | 1312551347133 |
9 | 304537071122 |
10 | 95926210139 |
11 | 37755932521 |
12 | 167115b110b |
13 | 90798234b6 |
14 | 48dddbd56b |
15 | 276678abae |
hex | 1655a5ce5b |
95926210139 has 2 divisors, whose sum is σ = 95926210140. Its totient is φ = 95926210138.
The previous prime is 95926210123. The next prime is 95926210141. The reversal of 95926210139 is 93101262959.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 95926210139 - 24 = 95926210123 is a prime.
Together with 95926210141, 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 = 95926210093 and 95926210102.
It is not a weakly prime, because it can be changed into another prime (95926210189) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 47963105069 + 47963105070.
It is an arithmetic number, because the mean of its divisors is an integer number (47963105070).
Almost surely, 295926210139 is an apocalyptic number.
95926210139 is a deficient number, since it is larger than the sum of its proper divisors (1).
95926210139 is an equidigital number, since it uses as much as digits as its factorization.
95926210139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 262440, while the sum is 47.
The spelling of 95926210139 in words is "ninety-five billion, nine hundred twenty-six million, two hundred ten thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •