Base | Representation |
---|---|
bin | 101111100100100110… |
… | …111111101111110001 |
3 | 11212211212011022111101 |
4 | 233210212333233301 |
5 | 1314102444134311 |
6 | 35244343044401 |
7 | 3455545262200 |
oct | 574446775761 |
9 | 155755138441 |
10 | 51080068081 |
11 | 1a7324041a9 |
12 | 9a96740701 |
13 | 4a80762273 |
14 | 2687d61237 |
15 | 14de5deec1 |
hex | be49bfbf1 |
51080068081 has 27 divisors (see below), whose sum is σ = 60299205771. Its totient is φ = 43144214064.
The previous prime is 51080068063. The next prime is 51080068087. The reversal of 51080068081 is 18086008015.
The square root of 51080068081 is 226009.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 12058016481 + 39022051600 = 109809^2 + 197540^2 .
It is not a de Polignac number, because 51080068081 - 25 = 51080068049 is a prime.
It is a super-2 number, since 2×510800680812 (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 51080068081.
It is not an unprimeable number, because it can be changed into a prime (51080068087) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 131311035 + ... + 131311423.
Almost surely, 251080068081 is an apocalyptic number.
51080068081 is the 226009-th square number.
51080068081 is the 113005-th centered octagonal number.
It is an amenable number.
51080068081 is a deficient number, since it is larger than the sum of its proper divisors (9219137690).
51080068081 is an frugal number, since it uses more digits than its factorization.
51080068081 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 958 (or 479 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 37.
The spelling of 51080068081 in words is "fifty-one billion, eighty million, sixty-eight thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •