Base | Representation |
---|---|
bin | 1101010111111… |
… | …1100101101011 |
3 | 10220120000210112 |
4 | 3111333211223 |
5 | 103330102011 |
6 | 5322204535 |
7 | 1250550326 |
oct | 325774553 |
9 | 126500715 |
10 | 56097131 |
11 | 29735672 |
12 | 1695374b |
13 | b81168c |
14 | 76437bd |
15 | 4dd158b |
hex | 357f96b |
56097131 has 2 divisors, whose sum is σ = 56097132. Its totient is φ = 56097130.
The previous prime is 56097121. The next prime is 56097163. The reversal of 56097131 is 13179065.
It is an a-pointer prime, because the next prime (56097163) can be obtained adding 56097131 to its sum of digits (32).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 56097131 - 214 = 56080747 is a prime.
It is a super-2 number, since 2×560971312 = 6293776212862322, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (56097121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28048565 + 28048566.
It is an arithmetic number, because the mean of its divisors is an integer number (28048566).
Almost surely, 256097131 is an apocalyptic number.
56097131 is a deficient number, since it is larger than the sum of its proper divisors (1).
56097131 is an equidigital number, since it uses as much as digits as its factorization.
56097131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5670, while the sum is 32.
The square root of 56097131 is about 7489.8017997808. The cubic root of 56097131 is about 382.8073051223.
The spelling of 56097131 in words is "fifty-six million, ninety-seven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •