Base | Representation |
---|---|
bin | 101111100110001010… |
… | …010100100011101001 |
3 | 11212220200011011020002 |
4 | 233212022110203221 |
5 | 1314131130334302 |
6 | 35251113112345 |
7 | 3456312505232 |
oct | 574612244351 |
9 | 155820134202 |
10 | 51106105577 |
11 | 1a74607859a |
12 | 9aa33b86b5 |
13 | 4a85c7a777 |
14 | 268b5bc089 |
15 | 14e1a34c02 |
hex | be62948e9 |
51106105577 has 2 divisors, whose sum is σ = 51106105578. Its totient is φ = 51106105576.
The previous prime is 51106105571. The next prime is 51106105613. The reversal of 51106105577 is 77550160115.
51106105577 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 48327866896 + 2778238681 = 219836^2 + 52709^2 .
It is a cyclic number.
It is not a de Polignac number, because 51106105577 - 212 = 51106101481 is a prime.
It is a super-2 number, since 2×511061055772 (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 51106105577.
It is not a weakly prime, because it can be changed into another prime (51106105571) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25553052788 + 25553052789.
It is an arithmetic number, because the mean of its divisors is an integer number (25553052789).
Almost surely, 251106105577 is an apocalyptic number.
It is an amenable number.
51106105577 is a deficient number, since it is larger than the sum of its proper divisors (1).
51106105577 is an equidigital number, since it uses as much as digits as its factorization.
51106105577 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36750, while the sum is 38.
The spelling of 51106105577 in words is "fifty-one billion, one hundred six million, one hundred five thousand, five hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •