Base | Representation |
---|---|
bin | 1101011001111… |
… | …0001000011001 |
3 | 10220210101101221 |
4 | 3112132020121 |
5 | 103343102413 |
6 | 5325012041 |
7 | 1251611134 |
oct | 326361031 |
9 | 126711357 |
10 | 56222233 |
11 | 29810661 |
12 | 169b4021 |
13 | b8565c2 |
14 | 767721b |
15 | 4e0868d |
hex | 359e219 |
56222233 has 2 divisors, whose sum is σ = 56222234. Its totient is φ = 56222232.
The previous prime is 56222227. The next prime is 56222237. The reversal of 56222233 is 33222265.
56222233 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., 42406144 + 13816089 = 6512^2 + 3717^2 .
It is a cyclic number.
It is not a de Polignac number, because 56222233 - 29 = 56221721 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 56222198 and 56222207.
It is not a weakly prime, because it can be changed into another prime (56222237) 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, 28111116 + 28111117.
It is an arithmetic number, because the mean of its divisors is an integer number (28111117).
Almost surely, 256222233 is an apocalyptic number.
It is an amenable number.
56222233 is a deficient number, since it is larger than the sum of its proper divisors (1).
56222233 is an equidigital number, since it uses as much as digits as its factorization.
56222233 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4320, while the sum is 25.
The square root of 56222233 is about 7498.1486381640. The cubic root of 56222233 is about 383.0916595562.
Adding to 56222233 its reverse (33222265), we get a palindrome (89444498).
The spelling of 56222233 in words is "fifty-six million, two hundred twenty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •