Base | Representation |
---|---|
bin | 10111010101110010101110… |
… | …11101011001000111101101 |
3 | 20201201202012221110222220012 |
4 | 23222321113131121013231 |
5 | 23211412304041310221 |
6 | 301054553333303005 |
7 | 13545130134636251 |
oct | 1352712735310755 |
9 | 221652187428805 |
10 | 51326326510061 |
11 | 15399411270a09 |
12 | 590b476a94a65 |
13 | 2284089b11205 |
14 | c962c939c261 |
15 | 5e01aee3265b |
hex | 2eae577591ed |
51326326510061 has 4 divisors (see below), whose sum is σ = 51326362886400. Its totient is φ = 51326290133724.
The previous prime is 51326326510007. The next prime is 51326326510097. The reversal of 51326326510061 is 16001562362315.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51326326510061 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51326326510001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15982541 + ... + 18923378.
It is an arithmetic number, because the mean of its divisors is an integer number (12831590721600).
Almost surely, 251326326510061 is an apocalyptic number.
It is an amenable number.
51326326510061 is a deficient number, since it is larger than the sum of its proper divisors (36376339).
51326326510061 is a wasteful number, since it uses less digits than its factorization.
51326326510061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36376338.
The product of its (nonzero) digits is 194400, while the sum is 41.
Adding to 51326326510061 its reverse (16001562362315), we get a palindrome (67327888872376).
The spelling of 51326326510061 in words is "fifty-one trillion, three hundred twenty-six billion, three hundred twenty-six million, five hundred ten thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •