Base | Representation |
---|---|
bin | 100000110101101… |
… | …010111001001101 |
3 | 1102101200122220222 |
4 | 200311222321031 |
5 | 2112020041422 |
6 | 130400321125 |
7 | 16436625521 |
oct | 4065527115 |
9 | 1371618828 |
10 | 550940237 |
11 | 262a9a611 |
12 | 1346131a5 |
13 | 8a1ac453 |
14 | 53255d81 |
15 | 3357b842 |
hex | 20d6ae4d |
550940237 has 2 divisors, whose sum is σ = 550940238. Its totient is φ = 550940236.
The previous prime is 550940189. The next prime is 550940239. The reversal of 550940237 is 732049055.
550940237 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 528034441 + 22905796 = 22979^2 + 4786^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-550940237 is a prime.
Together with 550940239, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 550940197 and 550940206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (550940239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 275470118 + 275470119.
It is an arithmetic number, because the mean of its divisors is an integer number (275470119).
Almost surely, 2550940237 is an apocalyptic number.
It is an amenable number.
550940237 is a deficient number, since it is larger than the sum of its proper divisors (1).
550940237 is an equidigital number, since it uses as much as digits as its factorization.
550940237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 37800, while the sum is 35.
The square root of 550940237 is about 23472.1161593922. The cubic root of 550940237 is about 819.7878873338.
The spelling of 550940237 in words is "five hundred fifty million, nine hundred forty thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •