Base | Representation |
---|---|
bin | 101111100011011010… |
… | …101000100010100001 |
3 | 11212210110111021221222 |
4 | 233203122220202201 |
5 | 1314032333100311 |
6 | 35242350024425 |
7 | 3455213156525 |
oct | 574332504241 |
9 | 155713437858 |
10 | 51060050081 |
11 | 1a7220813a7 |
12 | 9a8baa8115 |
13 | 4a795738b1 |
14 | 268542dd85 |
15 | 14dc988adb |
hex | be36a88a1 |
51060050081 has 2 divisors, whose sum is σ = 51060050082. Its totient is φ = 51060050080.
The previous prime is 51060050057. The next prime is 51060050113. The reversal of 51060050081 is 18005006015.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 47607312481 + 3452737600 = 218191^2 + 58760^2 .
It is a cyclic number.
It is not a de Polignac number, because 51060050081 - 218 = 51059787937 is a prime.
It is a super-2 number, since 2×510600500812 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 51060050081.
It is not a weakly prime, because it can be changed into another prime (51060052081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25530025040 + 25530025041.
It is an arithmetic number, because the mean of its divisors is an integer number (25530025041).
Almost surely, 251060050081 is an apocalyptic number.
It is an amenable number.
51060050081 is a deficient number, since it is larger than the sum of its proper divisors (1).
51060050081 is an equidigital number, since it uses as much as digits as its factorization.
51060050081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 26.
Adding to 51060050081 its reverse (18005006015), we get a palindrome (69065056096).
The spelling of 51060050081 in words is "fifty-one billion, sixty million, fifty thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •