Base | Representation |
---|---|
bin | 100001000110000… |
… | …100111010101101 |
3 | 1102200210011122102 |
4 | 201012010322231 |
5 | 2114120204013 |
6 | 131032424445 |
7 | 16521320546 |
oct | 4106047255 |
9 | 1380704572 |
10 | 555241133 |
11 | 265467977 |
12 | 135b48125 |
13 | 8b056c65 |
14 | 53a554cd |
15 | 33b2ad58 |
hex | 21184ead |
555241133 has 2 divisors, whose sum is σ = 555241134. Its totient is φ = 555241132.
The previous prime is 555241117. The next prime is 555241157. The reversal of 555241133 is 331142555.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 361836484 + 193404649 = 19022^2 + 13907^2 .
It is a cyclic number.
It is not a de Polignac number, because 555241133 - 24 = 555241117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 555241096 and 555241105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (555201133) 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, 277620566 + 277620567.
It is an arithmetic number, because the mean of its divisors is an integer number (277620567).
Almost surely, 2555241133 is an apocalyptic number.
It is an amenable number.
555241133 is a deficient number, since it is larger than the sum of its proper divisors (1).
555241133 is an equidigital number, since it uses as much as digits as its factorization.
555241133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9000, while the sum is 29.
The square root of 555241133 is about 23563.5551859222. Note that the first 3 decimals coincide. The cubic root of 555241133 is about 821.9155756361.
Adding to 555241133 its reverse (331142555), we get a palindrome (886383688).
The spelling of 555241133 in words is "five hundred fifty-five million, two hundred forty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •