Base | Representation |
---|---|
bin | 10111010000001100001000… |
… | …11111011000011001001111 |
3 | 20201001100022000211122121010 |
4 | 23220012010133120121033 |
5 | 23200234014432242100 |
6 | 300430314115540303 |
7 | 13525203304443222 |
oct | 1350060437303117 |
9 | 221040260748533 |
10 | 51133808477775 |
11 | 153247a9914901 |
12 | 589a0a8bba693 |
13 | 226bb8890848a |
14 | c8ac64c575b9 |
15 | 5da19377c750 |
hex | 2e81847d864f |
51133808477775 has 24 divisors (see below), whose sum is σ = 84600474223104. Its totient is φ = 27252253487200.
The previous prime is 51133808477683. The next prime is 51133808477777. The reversal of 51133808477775 is 57777480833115.
It is not a de Polignac number, because 51133808477775 - 28 = 51133808477519 is a prime.
It is a super-2 number, since 2×511338084777752 (a number of 28 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (66) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51133808477777) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 238780191 + ... + 238994240.
It is an arithmetic number, because the mean of its divisors is an integer number (3525019759296).
Almost surely, 251133808477775 is an apocalyptic number.
51133808477775 is a deficient number, since it is larger than the sum of its proper divisors (33466665745329).
51133808477775 is a wasteful number, since it uses less digits than its factorization.
51133808477775 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 477775871 (or 477775866 counting only the distinct ones).
The product of its (nonzero) digits is 138297600, while the sum is 66.
The spelling of 51133808477775 in words is "fifty-one trillion, one hundred thirty-three billion, eight hundred eight million, four hundred seventy-seven thousand, seven hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •