Base | Representation |
---|---|
bin | 11000111111001010001101 |
3 | 110022210010102 |
4 | 120333022031 |
5 | 3134101112 |
6 | 352220445 |
7 | 106450445 |
oct | 30771215 |
9 | 13283112 |
10 | 6550157 |
11 | 3774259 |
12 | 223a725 |
13 | 1484543 |
14 | c27125 |
15 | 895bc2 |
hex | 63f28d |
6550157 has 2 divisors, whose sum is σ = 6550158. Its totient is φ = 6550156.
The previous prime is 6550129. The next prime is 6550163. The reversal of 6550157 is 7510556.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4778596 + 1771561 = 2186^2 + 1331^2 .
It is a cyclic number.
It is not a de Polignac number, because 6550157 - 28 = 6549901 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6550177) 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, 3275078 + 3275079.
It is an arithmetic number, because the mean of its divisors is an integer number (3275079).
Almost surely, 26550157 is an apocalyptic number.
It is an amenable number.
6550157 is a deficient number, since it is larger than the sum of its proper divisors (1).
6550157 is an equidigital number, since it uses as much as digits as its factorization.
6550157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5250, while the sum is 29.
The square root of 6550157 is about 2559.3274507183. The cubic root of 6550157 is about 187.1043580432.
The spelling of 6550157 in words is "six million, five hundred fifty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •