Base | Representation |
---|---|
bin | 10111100000010101100100… |
… | …01110111000001100110111 |
3 | 20210000101101021011210211211 |
4 | 23300022302032320030313 |
5 | 23233331301412402402 |
6 | 301533232143342251 |
7 | 13613244232416124 |
oct | 1360126216701467 |
9 | 223011337153754 |
10 | 51688626684727 |
11 | 1551902927556a |
12 | 59697285b1987 |
13 | 22ac2a7aa37a6 |
14 | ca9a5866974b |
15 | 5e9816c4c4d7 |
hex | 2f02b23b8337 |
51688626684727 has 16 divisors (see below), whose sum is σ = 52788875796000. Its totient is φ = 50593088251264.
The previous prime is 51688626684691. The next prime is 51688626684791. The reversal of 51688626684727 is 72748662688615.
51688626684727 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 51688626684727 - 243 = 42892533662519 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 (51688626684797) 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 15 ways as a sum of consecutive naturals, for example, 65946849 + ... + 66726037.
It is an arithmetic number, because the mean of its divisors is an integer number (3299304737250).
Almost surely, 251688626684727 is an apocalyptic number.
51688626684727 is a deficient number, since it is larger than the sum of its proper divisors (1100249111273).
51688626684727 is a wasteful number, since it uses less digits than its factorization.
51688626684727 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 782210.
The product of its digits is 2601123840, while the sum is 76.
The spelling of 51688626684727 in words is "fifty-one trillion, six hundred eighty-eight billion, six hundred twenty-six million, six hundred eighty-four thousand, seven hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •