Base | Representation |
---|---|
bin | 1101010110100… |
… | …1100001101001 |
3 | 10220101102211111 |
4 | 3111221201221 |
5 | 103314204021 |
6 | 5320230321 |
7 | 1250023006 |
oct | 325514151 |
9 | 126342744 |
10 | 56006761 |
11 | 29683788 |
12 | 1690b3a1 |
13 | b7ac4c5 |
14 | 761c8ad |
15 | 4db48e1 |
hex | 3569869 |
56006761 has 2 divisors, whose sum is σ = 56006762. Its totient is φ = 56006760.
The previous prime is 56006747. The next prime is 56006777. The reversal of 56006761 is 16760065.
56006761 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 52838361 + 3168400 = 7269^2 + 1780^2 .
It is a cyclic number.
It is not a de Polignac number, because 56006761 - 215 = 55973993 is a prime.
It is a super-3 number, since 3×560067613 (a number of 24 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (56006701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28003380 + 28003381.
It is an arithmetic number, because the mean of its divisors is an integer number (28003381).
Almost surely, 256006761 is an apocalyptic number.
It is an amenable number.
56006761 is a deficient number, since it is larger than the sum of its proper divisors (1).
56006761 is an equidigital number, since it uses as much as digits as its factorization.
56006761 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 31.
The square root of 56006761 is about 7483.7664982280. The cubic root of 56006761 is about 382.6016327536.
The spelling of 56006761 in words is "fifty-six million, six thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •