Base | Representation |
---|---|
bin | 10111001100010011000001… |
… | …00001011101000001010101 |
3 | 20200120120001221110121102110 |
4 | 23212021200201131001111 |
5 | 23141041111112230221 |
6 | 300245034332301233 |
7 | 13512430025220216 |
oct | 1346114041350125 |
9 | 220516057417373 |
10 | 51000061055061 |
11 | 15283005995608 |
12 | 58781a1311819 |
13 | 225c392547a71 |
14 | c845b7bc540d |
15 | 5d6966936776 |
hex | 2e626085d055 |
51000061055061 has 8 divisors (see below), whose sum is σ = 68931589371520. Its totient is φ = 33534286720992.
The previous prime is 51000061055051. The next prime is 51000061055077. The reversal of 51000061055061 is 16055016000015.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51000061055061 - 27 = 51000061054933 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51000061055051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 116438495341 + ... + 116438495778.
It is an arithmetic number, because the mean of its divisors is an integer number (8616448671440).
Almost surely, 251000061055061 is an apocalyptic number.
It is an amenable number.
51000061055061 is a deficient number, since it is larger than the sum of its proper divisors (17931528316459).
51000061055061 is a wasteful number, since it uses less digits than its factorization.
51000061055061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 232876991195.
The product of its (nonzero) digits is 4500, while the sum is 30.
Adding to 51000061055061 its reverse (16055016000015), we get a palindrome (67055077055076).
The spelling of 51000061055061 in words is "fifty-one trillion, sixty-one million, fifty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •