Base | Representation |
---|---|
bin | 110100101000010000… |
… | …111101110111000011 |
3 | 12101212021202002021102 |
4 | 310220100331313003 |
5 | 1411213042024141 |
6 | 41543235445015 |
7 | 4040242006463 |
oct | 645020756703 |
9 | 171767662242 |
10 | 56510111171 |
11 | 21a69536a18 |
12 | ab5115676b |
13 | 5437720c07 |
14 | 2a411a7ba3 |
15 | 170b19199b |
hex | d2843ddc3 |
56510111171 has 2 divisors, whose sum is σ = 56510111172. Its totient is φ = 56510111170.
The previous prime is 56510111153. The next prime is 56510111173. The reversal of 56510111171 is 17111101565.
56510111171 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 56510111171 - 26 = 56510111107 is a prime.
Together with 56510111173, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (56510111173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28255055585 + 28255055586.
It is an arithmetic number, because the mean of its divisors is an integer number (28255055586).
Almost surely, 256510111171 is an apocalyptic number.
56510111171 is a deficient number, since it is larger than the sum of its proper divisors (1).
56510111171 is an equidigital number, since it uses as much as digits as its factorization.
56510111171 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1050, while the sum is 29.
The spelling of 56510111171 in words is "fifty-six billion, five hundred ten million, one hundred eleven thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •