Base | Representation |
---|---|
bin | 101111100111001000… |
… | …101010111010000011 |
3 | 11212221210220112121222 |
4 | 233213020222322003 |
5 | 1314144321400201 |
6 | 35252455305255 |
7 | 3456601440611 |
oct | 574710527203 |
9 | 155853815558 |
10 | 51122450051 |
11 | 1a754321422 |
12 | 9aa897b22b |
13 | 4a8948105a |
14 | 268d8346b1 |
15 | 14e31b291b |
hex | be722ae83 |
51122450051 has 2 divisors, whose sum is σ = 51122450052. Its totient is φ = 51122450050.
The previous prime is 51122450033. The next prime is 51122450063. The reversal of 51122450051 is 15005422115.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51122450051 is a prime.
It is a super-2 number, since 2×511224500512 (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 51122450051.
It is not a weakly prime, because it can be changed into another prime (51122450551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25561225025 + 25561225026.
It is an arithmetic number, because the mean of its divisors is an integer number (25561225026).
Almost surely, 251122450051 is an apocalyptic number.
51122450051 is a deficient number, since it is larger than the sum of its proper divisors (1).
51122450051 is an equidigital number, since it uses as much as digits as its factorization.
51122450051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2000, while the sum is 26.
Adding to 51122450051 its reverse (15005422115), we get a palindrome (66127872166).
The spelling of 51122450051 in words is "fifty-one billion, one hundred twenty-two million, four hundred fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •