Base | Representation |
---|---|
bin | 101101101011111101… |
… | …100011010011010111 |
3 | 11200121210101211200101 |
4 | 231223331203103113 |
5 | 1300431310002001 |
6 | 34311434554531 |
7 | 3354436406452 |
oct | 555375432327 |
9 | 150553354611 |
10 | 49055937751 |
11 | 19893886117 |
12 | 9610898a47 |
13 | 481a2b9802 |
14 | 25351c4499 |
15 | 1421a62a01 |
hex | b6bf634d7 |
49055937751 has 2 divisors, whose sum is σ = 49055937752. Its totient is φ = 49055937750.
The previous prime is 49055937737. The next prime is 49055937781. The reversal of 49055937751 is 15773955094.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-49055937751 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 49055937692 and 49055937701.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (49055937781) 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, 24527968875 + 24527968876.
It is an arithmetic number, because the mean of its divisors is an integer number (24527968876).
Almost surely, 249055937751 is an apocalyptic number.
49055937751 is a deficient number, since it is larger than the sum of its proper divisors (1).
49055937751 is an equidigital number, since it uses as much as digits as its factorization.
49055937751 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5953500, while the sum is 55.
The spelling of 49055937751 in words is "forty-nine billion, fifty-five million, nine hundred thirty-seven thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •