Base | Representation |
---|---|
bin | 10010011000010010001… |
… | …11010011111100001011 |
3 | 2020101001020022121112101 |
4 | 21030021013103330023 |
5 | 40321314323313024 |
6 | 1202040233254231 |
7 | 63424324550131 |
oct | 11141107237413 |
9 | 2211036277471 |
10 | 631513104139 |
11 | 223906758115 |
12 | a2484564377 |
13 | 477226522a8 |
14 | 227cb643751 |
15 | 1166172dc44 |
hex | 93091d3f0b |
631513104139 has 2 divisors, whose sum is σ = 631513104140. Its totient is φ = 631513104138.
The previous prime is 631513104097. The next prime is 631513104163. The reversal of 631513104139 is 931401315136.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-631513104139 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 631513104098 and 631513104107.
It is not a weakly prime, because it can be changed into another prime (631513194139) 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, 315756552069 + 315756552070.
It is an arithmetic number, because the mean of its divisors is an integer number (315756552070).
Almost surely, 2631513104139 is an apocalyptic number.
631513104139 is a deficient number, since it is larger than the sum of its proper divisors (1).
631513104139 is an equidigital number, since it uses as much as digits as its factorization.
631513104139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 29160, while the sum is 37.
The spelling of 631513104139 in words is "six hundred thirty-one billion, five hundred thirteen million, one hundred four thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •