Base | Representation |
---|---|
bin | 11010100101010… |
… | …11011111101001 |
3 | 120112121121020202 |
4 | 31102223133221 |
5 | 424042004203 |
6 | 34043401545 |
7 | 5345321246 |
oct | 1522533751 |
9 | 515547222 |
10 | 223000553 |
11 | 104972686 |
12 | 628232b5 |
13 | 3727b3b9 |
14 | 2188c5cd |
15 | 1489e388 |
hex | d4ab7e9 |
223000553 has 2 divisors, whose sum is σ = 223000554. Its totient is φ = 223000552.
The previous prime is 223000529. The next prime is 223000573. The reversal of 223000553 is 355000322.
It is an a-pointer prime, because the next prime (223000573) can be obtained adding 223000553 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 153561664 + 69438889 = 12392^2 + 8333^2 .
It is a cyclic number.
It is not a de Polignac number, because 223000553 - 210 = 222999529 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (223000513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111500276 + 111500277.
It is an arithmetic number, because the mean of its divisors is an integer number (111500277).
Almost surely, 2223000553 is an apocalyptic number.
It is an amenable number.
223000553 is a deficient number, since it is larger than the sum of its proper divisors (1).
223000553 is an equidigital number, since it uses as much as digits as its factorization.
223000553 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 900, while the sum is 20.
The square root of 223000553 is about 14933.2030388661. The cubic root of 223000553 is about 606.4132007152.
Adding to 223000553 its reverse (355000322), we get a palindrome (578000875).
The spelling of 223000553 in words is "two hundred twenty-three million, five hundred fifty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •