Base | Representation |
---|---|
bin | 10111100001011110001001… |
… | …10101000100011100001111 |
3 | 20210011002221220220122001010 |
4 | 23300233010311010130033 |
5 | 23240001102402020022 |
6 | 302003154531220303 |
7 | 13616123662104300 |
oct | 1360570465043417 |
9 | 223132856818033 |
10 | 51727593391887 |
11 | 15533604a30386 |
12 | 59751a2447693 |
13 | 22b2b77a6016a |
14 | cab8b39007a7 |
15 | 5ea847b7850c |
hex | 2f0bc4d4470f |
51727593391887 has 24 divisors (see below), whose sum is σ = 80245365134256. Its totient is φ = 29553167699328.
The previous prime is 51727593391867. The next prime is 51727593391961. The reversal of 51727593391887 is 78819339572715.
51727593391887 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 51727593391887 - 27 = 51727593391759 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51727593391867) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 31683708 + ... + 33276305.
It is an arithmetic number, because the mean of its divisors is an integer number (3343556880594).
Almost surely, 251727593391887 is an apocalyptic number.
51727593391887 is a deficient number, since it is larger than the sum of its proper divisors (28517771742369).
51727593391887 is a wasteful number, since it uses less digits than its factorization.
51727593391887 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64965447 (or 64965440 counting only the distinct ones).
The product of its digits is 800150400, while the sum is 75.
The spelling of 51727593391887 in words is "fifty-one trillion, seven hundred twenty-seven billion, five hundred ninety-three million, three hundred ninety-one thousand, eight hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •