Base | Representation |
---|---|
bin | 111010110100000010… |
… | …100010011000011011 |
3 | 20001000001001202222222 |
4 | 322310002202120123 |
5 | 2013312411344024 |
6 | 45002153534255 |
7 | 4363630021421 |
oct | 726402423033 |
9 | 201001052888 |
10 | 63150106139 |
11 | 2486665246a |
12 | 102a4a1438b |
13 | 5c55279a13 |
14 | 30b0db1111 |
15 | 199909785e |
hex | eb40a261b |
63150106139 has 2 divisors, whose sum is σ = 63150106140. Its totient is φ = 63150106138.
The previous prime is 63150106081. The next prime is 63150106157. The reversal of 63150106139 is 93160105136.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-63150106139 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 63150106099 and 63150106108.
It is not a weakly prime, because it can be changed into another prime (63150106739) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 31575053069 + 31575053070.
It is an arithmetic number, because the mean of its divisors is an integer number (31575053070).
Almost surely, 263150106139 is an apocalyptic number.
63150106139 is a deficient number, since it is larger than the sum of its proper divisors (1).
63150106139 is an equidigital number, since it uses as much as digits as its factorization.
63150106139 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 14580, while the sum is 35.
The spelling of 63150106139 in words is "sixty-three billion, one hundred fifty million, one hundred six thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •