Base | Representation |
---|---|
bin | 101110110100110000… |
… | …111110101111101011 |
3 | 11210202220202111011001 |
4 | 232310300332233223 |
5 | 1310432002112201 |
6 | 35032550415431 |
7 | 3426630446014 |
oct | 566460765753 |
9 | 153686674131 |
10 | 50277379051 |
11 | 1a3602a7039 |
12 | 98b1961577 |
13 | 498337a443 |
14 | 260d4d600b |
15 | 1493dd6301 |
hex | bb4c3ebeb |
50277379051 has 2 divisors, whose sum is σ = 50277379052. Its totient is φ = 50277379050.
The previous prime is 50277379049. The next prime is 50277379063. The reversal of 50277379051 is 15097377205.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 50277379051 - 21 = 50277379049 is a prime.
Together with 50277379049, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 50277378992 and 50277379010.
It is not a weakly prime, because it can be changed into another prime (50277379091) 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, 25138689525 + 25138689526.
It is an arithmetic number, because the mean of its divisors is an integer number (25138689526).
Almost surely, 250277379051 is an apocalyptic number.
50277379051 is a deficient number, since it is larger than the sum of its proper divisors (1).
50277379051 is an equidigital number, since it uses as much as digits as its factorization.
50277379051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 463050, while the sum is 46.
The spelling of 50277379051 in words is "fifty billion, two hundred seventy-seven million, three hundred seventy-nine thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •