Base | Representation |
---|---|
bin | 1101010111010… |
… | …1110001110111 |
3 | 10220110222200101 |
4 | 3111311301313 |
5 | 103322310301 |
6 | 5321254531 |
7 | 1250322226 |
oct | 325656167 |
9 | 126428611 |
10 | 56056951 |
11 | 29708465 |
12 | 16934447 |
13 | b7c92c2 |
14 | 7632cbd |
15 | 4dc4701 |
hex | 3575c77 |
56056951 has 2 divisors, whose sum is σ = 56056952. Its totient is φ = 56056950.
The previous prime is 56056943. The next prime is 56057033. The reversal of 56056951 is 15965065.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 56056951 - 23 = 56056943 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 56056951.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56056901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28028475 + 28028476.
It is an arithmetic number, because the mean of its divisors is an integer number (28028476).
Almost surely, 256056951 is an apocalyptic number.
56056951 is a deficient number, since it is larger than the sum of its proper divisors (1).
56056951 is an equidigital number, since it uses as much as digits as its factorization.
56056951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40500, while the sum is 37.
The square root of 56056951 is about 7487.1190053318. The cubic root of 56056951 is about 382.7158870705.
The spelling of 56056951 in words is "fifty-six million, fifty-six thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •