Base | Representation |
---|---|
bin | 110100101110000110… |
… | …100100011001101111 |
3 | 12102010010000211101012 |
4 | 310232012210121233 |
5 | 1411413130030001 |
6 | 42001054535435 |
7 | 4042541322002 |
oct | 645606443157 |
9 | 172103024335 |
10 | 56608048751 |
11 | 22009849971 |
12 | ab79b0757b |
13 | 5451ac1a47 |
14 | 2a501bd539 |
15 | 1714a8a2bb |
hex | d2e1a466f |
56608048751 has 2 divisors, whose sum is σ = 56608048752. Its totient is φ = 56608048750.
The previous prime is 56608048747. The next prime is 56608048769. The reversal of 56608048751 is 15784080665.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 56608048751 - 22 = 56608048747 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 56608048751.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56608048771) 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 as a sum of consecutive naturals, namely, 28304024375 + 28304024376.
It is an arithmetic number, because the mean of its divisors is an integer number (28304024376).
Almost surely, 256608048751 is an apocalyptic number.
56608048751 is a deficient number, since it is larger than the sum of its proper divisors (1).
56608048751 is an equidigital number, since it uses as much as digits as its factorization.
56608048751 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1612800, while the sum is 50.
The spelling of 56608048751 in words is "fifty-six billion, six hundred eight million, forty-eight thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •