Base | Representation |
---|---|
bin | 100001000100000… |
… | …100000001000101 |
3 | 1102122210100101202 |
4 | 201010010001011 |
5 | 2114001310112 |
6 | 131013232245 |
7 | 16513661345 |
oct | 4104040105 |
9 | 1378710352 |
10 | 554713157 |
11 | 265137229 |
12 | 135932685 |
13 | 8ac0084b |
14 | 53958d25 |
15 | 33a746c2 |
hex | 21104045 |
554713157 has 2 divisors, whose sum is σ = 554713158. Its totient is φ = 554713156.
The previous prime is 554713123. The next prime is 554713177. The reversal of 554713157 is 751317455.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 371949796 + 182763361 = 19286^2 + 13519^2 .
It is a cyclic number.
It is not a de Polignac number, because 554713157 - 28 = 554712901 is a prime.
It is equal to p29079713 and since 554713157 and 29079713 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 554713157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (554713177) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 277356578 + 277356579.
It is an arithmetic number, because the mean of its divisors is an integer number (277356579).
Almost surely, 2554713157 is an apocalyptic number.
It is an amenable number.
554713157 is a deficient number, since it is larger than the sum of its proper divisors (1).
554713157 is an equidigital number, since it uses as much as digits as its factorization.
554713157 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 73500, while the sum is 38.
The square root of 554713157 is about 23552.3492883406. The cubic root of 554713157 is about 821.6549745552.
The spelling of 554713157 in words is "five hundred fifty-four million, seven hundred thirteen thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •