Base | Representation |
---|---|
bin | 10111001101111001100010… |
… | …01010010111110011111111 |
3 | 20200202211010202221001111122 |
4 | 23212330301022113303333 |
5 | 23142441321332100421 |
6 | 300330220054341155 |
7 | 13516415666365124 |
oct | 1346746112276377 |
9 | 220684122831448 |
10 | 51055101050111 |
11 | 152a438a5a2524 |
12 | 58869a205a7bb |
13 | 226462450a882 |
14 | c87119a2874b |
15 | 5d80d89d32ab |
hex | 2e6f31297cff |
51055101050111 has 2 divisors, whose sum is σ = 51055101050112. Its totient is φ = 51055101050110.
The previous prime is 51055101050087. The next prime is 51055101050123. The reversal of 51055101050111 is 11105010155015.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 51055101050111 - 234 = 51037921180927 is a prime.
It is a super-2 number, since 2×510551010501112 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51055101050141) 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, 25527550525055 + 25527550525056.
It is an arithmetic number, because the mean of its divisors is an integer number (25527550525056).
Almost surely, 251055101050111 is an apocalyptic number.
51055101050111 is a deficient number, since it is larger than the sum of its proper divisors (1).
51055101050111 is an equidigital number, since it uses as much as digits as its factorization.
51055101050111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 625, while the sum is 26.
The spelling of 51055101050111 in words is "fifty-one trillion, fifty-five billion, one hundred one million, fifty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •