Base | Representation |
---|---|
bin | 100000111011011… |
… | …101011011100101 |
3 | 1102111112202211211 |
4 | 200323131123211 |
5 | 2112412123312 |
6 | 130453031421 |
7 | 16455546412 |
oct | 4073353345 |
9 | 1374482754 |
10 | 552457957 |
11 | 263936927 |
12 | 135025571 |
13 | 8a5c11cc |
14 | 5352d109 |
15 | 3377b3a7 |
hex | 20edd6e5 |
552457957 has 2 divisors, whose sum is σ = 552457958. Its totient is φ = 552457956.
The previous prime is 552457951. The next prime is 552457987. The reversal of 552457957 is 759754255.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 521254561 + 31203396 = 22831^2 + 5586^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-552457957 is a prime.
It is a super-2 number, since 2×5524579572 = 610419588505227698, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 552457957.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (552457951) 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, 276228978 + 276228979.
It is an arithmetic number, because the mean of its divisors is an integer number (276228979).
Almost surely, 2552457957 is an apocalyptic number.
It is an amenable number.
552457957 is a deficient number, since it is larger than the sum of its proper divisors (1).
552457957 is an equidigital number, since it uses as much as digits as its factorization.
552457957 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2205000, while the sum is 49.
The square root of 552457957 is about 23504.4242005628. The cubic root of 552457957 is about 820.5399759916.
The spelling of 552457957 in words is "five hundred fifty-two million, four hundred fifty-seven thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •