Base | Representation |
---|---|
bin | 101111100001001001… |
… | …111010000111011001 |
3 | 11212200211002210120222 |
4 | 233201021322013121 |
5 | 1313443130024233 |
6 | 35234512525425 |
7 | 3454242534524 |
oct | 574111720731 |
9 | 155624083528 |
10 | 51022111193 |
11 | 1a702719349 |
12 | 9a7b250875 |
13 | 4a7174c251 |
14 | 2680395bbb |
15 | 14d9492898 |
hex | be127a1d9 |
51022111193 has 2 divisors, whose sum is σ = 51022111194. Its totient is φ = 51022111192.
The previous prime is 51022111163. The next prime is 51022111199. The reversal of 51022111193 is 39111122015.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 47344537744 + 3677573449 = 217588^2 + 60643^2 .
It is a cyclic number.
It is not a de Polignac number, because 51022111193 - 210 = 51022110169 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (51022111199) 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, 25511055596 + 25511055597.
It is an arithmetic number, because the mean of its divisors is an integer number (25511055597).
Almost surely, 251022111193 is an apocalyptic number.
It is an amenable number.
51022111193 is a deficient number, since it is larger than the sum of its proper divisors (1).
51022111193 is an equidigital number, since it uses as much as digits as its factorization.
51022111193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 26.
The spelling of 51022111193 in words is "fifty-one billion, twenty-two million, one hundred eleven thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •