Base | Representation |
---|---|
bin | 101111100110011011… |
… | …011101110111000011 |
3 | 11212220222121111121001 |
4 | 233212123131313003 |
5 | 1314133303201011 |
6 | 35251353312431 |
7 | 3456365635003 |
oct | 574633356703 |
9 | 155828544531 |
10 | 51110600131 |
11 | 1a7486683a8 |
12 | 9aa4a05717 |
13 | 4a86b92476 |
14 | 268c02c003 |
15 | 14e21217c1 |
hex | be66dddc3 |
51110600131 has 2 divisors, whose sum is σ = 51110600132. Its totient is φ = 51110600130.
The previous prime is 51110600089. The next prime is 51110600137. The reversal of 51110600131 is 13100601115.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 51110600131 - 225 = 51077045699 is a prime.
It is a super-2 number, since 2×511106001312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51110600099 and 51110600108.
It is not a weakly prime, because it can be changed into another prime (51110600137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25555300065 + 25555300066.
It is an arithmetic number, because the mean of its divisors is an integer number (25555300066).
Almost surely, 251110600131 is an apocalyptic number.
51110600131 is a deficient number, since it is larger than the sum of its proper divisors (1).
51110600131 is an equidigital number, since it uses as much as digits as its factorization.
51110600131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 19.
The spelling of 51110600131 in words is "fifty-one billion, one hundred ten million, six hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •