Base | Representation |
---|---|
bin | 1101011100000… |
… | …0100011111001 |
3 | 10221001112212001 |
4 | 3113000203321 |
5 | 103412111012 |
6 | 5332021001 |
7 | 1253036236 |
oct | 327004371 |
9 | 127045761 |
10 | 56363257 |
11 | 298a7605 |
12 | 16a61761 |
13 | b8a5852 |
14 | 76b278d |
15 | 4e35357 |
hex | 35c08f9 |
56363257 has 2 divisors, whose sum is σ = 56363258. Its totient is φ = 56363256.
The previous prime is 56363201. The next prime is 56363287. The reversal of 56363257 is 75236365.
It is a happy number.
56363257 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 can be written as a sum of positive squares in only one way, i.e., 49266361 + 7096896 = 7019^2 + 2664^2 .
It is a cyclic number.
It is not a de Polignac number, because 56363257 - 215 = 56330489 is a prime.
It is a Chen prime.
It is equal to p3358747 and since 56363257 and 3358747 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (56363287) 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, 28181628 + 28181629.
It is an arithmetic number, because the mean of its divisors is an integer number (28181629).
Almost surely, 256363257 is an apocalyptic number.
It is an amenable number.
56363257 is a deficient number, since it is larger than the sum of its proper divisors (1).
56363257 is an equidigital number, since it uses as much as digits as its factorization.
56363257 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 113400, while the sum is 37.
The square root of 56363257 is about 7507.5466698516. The cubic root of 56363257 is about 383.4116990803.
The spelling of 56363257 in words is "fifty-six million, three hundred sixty-three thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •