Base | Representation |
---|---|
bin | 10110110011101011100100… |
… | …10100111111011101110011 |
3 | 20120120200220000001011200112 |
4 | 23121311302110333131303 |
5 | 23033211401303031401 |
6 | 254400313412211535 |
7 | 13364345046234221 |
oct | 1331656224773563 |
9 | 216520800034615 |
10 | 50154251220851 |
11 | 14a873313283a8 |
12 | 5760291309bab |
13 | 21ca6aa97311b |
14 | c5569b825b11 |
15 | 5be961a8a3bb |
hex | 2d9d7253f773 |
50154251220851 has 2 divisors, whose sum is σ = 50154251220852. Its totient is φ = 50154251220850.
The previous prime is 50154251220803. The next prime is 50154251220881. The reversal of 50154251220851 is 15802215245105.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 50154251220851 - 226 = 50154184111987 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 50154251220799 and 50154251220808.
It is not a weakly prime, because it can be changed into another prime (50154251220881) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25077125610425 + 25077125610426.
It is an arithmetic number, because the mean of its divisors is an integer number (25077125610426).
Almost surely, 250154251220851 is an apocalyptic number.
50154251220851 is a deficient number, since it is larger than the sum of its proper divisors (1).
50154251220851 is an equidigital number, since it uses as much as digits as its factorization.
50154251220851 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 160000, while the sum is 41.
Adding to 50154251220851 its reverse (15802215245105), we get a palindrome (65956466465956).
The spelling of 50154251220851 in words is "fifty trillion, one hundred fifty-four billion, two hundred fifty-one million, two hundred twenty thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •