Base | Representation |
---|---|
bin | 1101011111001… |
… | …1100101000111 |
3 | 10221110011111211 |
4 | 3113303211013 |
5 | 103440302411 |
6 | 5340312251 |
7 | 1254566422 |
oct | 327634507 |
9 | 127404454 |
10 | 56572231 |
11 | 29a2a611 |
12 | 16b42687 |
13 | b9499c1 |
14 | 77289b9 |
15 | 4e77221 |
hex | 35f3947 |
56572231 has 2 divisors, whose sum is σ = 56572232. Its totient is φ = 56572230.
The previous prime is 56572213. The next prime is 56572237. The reversal of 56572231 is 13227565.
Together with previous prime (56572213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 56572231 - 215 = 56539463 is a prime.
It is a super-2 number, since 2×565722312 = 6400834640634722, which contains 22 as substring.
It is a Chen prime.
It is equal to p3370378 and since 56572231 and 3370378 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 56572193 and 56572202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56572237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28286115 + 28286116.
It is an arithmetic number, because the mean of its divisors is an integer number (28286116).
Almost surely, 256572231 is an apocalyptic number.
56572231 is a deficient number, since it is larger than the sum of its proper divisors (1).
56572231 is an equidigital number, since it uses as much as digits as its factorization.
56572231 is an evil number, because the sum of its binary digits is even.
The product of its digits is 12600, while the sum is 31.
The square root of 56572231 is about 7521.4513891934. The cubic root of 56572231 is about 383.8849640046.
Adding to 56572231 its reverse (13227565), we get a palindrome (69799796).
The spelling of 56572231 in words is "fifty-six million, five hundred seventy-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •