Base | Representation |
---|---|
bin | 101101111000011110… |
… | …000110100111111111 |
3 | 11201011102021211022112 |
4 | 231320132012213333 |
5 | 1301344021011011 |
6 | 34344333004235 |
7 | 3362565241031 |
oct | 557036064777 |
9 | 151142254275 |
10 | 49265797631 |
11 | 19991292a36 |
12 | 966b02367b |
13 | 485191695b |
14 | 2555011c51 |
15 | 14351b858b |
hex | b787869ff |
49265797631 has 2 divisors, whose sum is σ = 49265797632. Its totient is φ = 49265797630.
The previous prime is 49265797597. The next prime is 49265797663. The reversal of 49265797631 is 13679756294.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-49265797631 is a prime.
It is a super-2 number, since 2×492657976312 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (49265793631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24632898815 + 24632898816.
It is an arithmetic number, because the mean of its divisors is an integer number (24632898816).
Almost surely, 249265797631 is an apocalyptic number.
49265797631 is a deficient number, since it is larger than the sum of its proper divisors (1).
49265797631 is an equidigital number, since it uses as much as digits as its factorization.
49265797631 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 17146080, while the sum is 59.
The spelling of 49265797631 in words is "forty-nine billion, two hundred sixty-five million, seven hundred ninety-seven thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •