Base | Representation |
---|---|
bin | 100001001010011… |
… | …000010000110101 |
3 | 1102202220110201101 |
4 | 201022120100311 |
5 | 2114412301244 |
6 | 131112530101 |
7 | 16534025623 |
oct | 4112302065 |
9 | 1382813641 |
10 | 556368949 |
11 | 266068254 |
12 | 1363b0931 |
13 | 8b3603c6 |
14 | 53c6a513 |
15 | 33ca00d4 |
hex | 21298435 |
556368949 has 2 divisors, whose sum is σ = 556368950. Its totient is φ = 556368948.
The previous prime is 556368937. The next prime is 556369007. The reversal of 556368949 is 949863655.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 502566724 + 53802225 = 22418^2 + 7335^2 .
It is a cyclic number.
It is not a de Polignac number, because 556368949 - 223 = 547980341 is a prime.
It is a super-2 number, since 2×5563689492 = 619092814822729202, which contains 22 as substring.
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 556368949.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (556318949) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 278184474 + 278184475.
It is an arithmetic number, because the mean of its divisors is an integer number (278184475).
Almost surely, 2556368949 is an apocalyptic number.
It is an amenable number.
556368949 is a deficient number, since it is larger than the sum of its proper divisors (1).
556368949 is an equidigital number, since it uses as much as digits as its factorization.
556368949 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6998400, while the sum is 55.
The square root of 556368949 is about 23587.4744091011. The cubic root of 556368949 is about 822.4716959492.
The spelling of 556368949 in words is "five hundred fifty-six million, three hundred sixty-eight thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •