Base | Representation |
---|---|
bin | 1101011000001… |
… | …0110010010111 |
3 | 10220120200202201 |
4 | 3112002302113 |
5 | 103331011411 |
6 | 5322345331 |
7 | 1250633452 |
oct | 326026227 |
9 | 126520681 |
10 | 56110231 |
11 | 297444a1 |
12 | 1695b247 |
13 | b817628 |
14 | 7648499 |
15 | 4dd53c1 |
hex | 3582c97 |
56110231 has 2 divisors, whose sum is σ = 56110232. Its totient is φ = 56110230.
The previous prime is 56110193. The next prime is 56110237. The reversal of 56110231 is 13201165.
56110231 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 56110231 - 221 = 54013079 is a prime.
It is a super-2 number, since 2×561102312 = 6296716045746722, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 56110199 and 56110208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56110237) 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, 28055115 + 28055116.
It is an arithmetic number, because the mean of its divisors is an integer number (28055116).
Almost surely, 256110231 is an apocalyptic number.
56110231 is a deficient number, since it is larger than the sum of its proper divisors (1).
56110231 is an equidigital number, since it uses as much as digits as its factorization.
56110231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 56110231 is about 7490.6762712054. The cubic root of 56110231 is about 382.8371009741.
Adding to 56110231 its reverse (13201165), we get a palindrome (69311396).
The spelling of 56110231 in words is "fifty-six million, one hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •