Base | Representation |
---|---|
bin | 100001000110011… |
… | …101111011001001 |
3 | 1102200222101011001 |
4 | 201012131323021 |
5 | 2114131443221 |
6 | 131034535001 |
7 | 16522225303 |
oct | 4106357311 |
9 | 1380871131 |
10 | 555343561 |
11 | 265527923 |
12 | 135b97461 |
13 | 8b091776 |
14 | 53a80973 |
15 | 33b4b391 |
hex | 2119dec9 |
555343561 has 2 divisors, whose sum is σ = 555343562. Its totient is φ = 555343560.
The previous prime is 555343553. The next prime is 555343567. The reversal of 555343561 is 165343555.
555343561 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., 500864400 + 54479161 = 22380^2 + 7381^2 .
It is a cyclic number.
It is not a de Polignac number, because 555343561 - 23 = 555343553 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 555343561.
It is not a weakly prime, because it can be changed into another prime (555343567) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 277671780 + 277671781.
It is an arithmetic number, because the mean of its divisors is an integer number (277671781).
Almost surely, 2555343561 is an apocalyptic number.
It is an amenable number.
555343561 is a deficient number, since it is larger than the sum of its proper divisors (1).
555343561 is an equidigital number, since it uses as much as digits as its factorization.
555343561 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 135000, while the sum is 37.
The square root of 555343561 is about 23565.7285268247. The cubic root of 555343561 is about 821.9661134339.
It can be divided in two parts, 55534 and 3561, that added together give a palindrome (59095).
The spelling of 555343561 in words is "five hundred fifty-five million, three hundred forty-three thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •