Base | Representation |
---|---|
bin | 100000110100001… |
… | …101000111101111 |
3 | 1102100222011001021 |
4 | 200310031013233 |
5 | 2111420244033 |
6 | 130344155011 |
7 | 16433435644 |
oct | 4064150757 |
9 | 1370864037 |
10 | 550556143 |
11 | 262857a85 |
12 | 134468a67 |
13 | 8a0a6687 |
14 | 53195dcb |
15 | 33502b2d |
hex | 20d0d1ef |
550556143 has 2 divisors, whose sum is σ = 550556144. Its totient is φ = 550556142.
The previous prime is 550556131. The next prime is 550556177. The reversal of 550556143 is 341655055.
550556143 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (550556177) can be obtained adding 550556143 to its sum of digits (34).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 550556143 - 29 = 550555631 is a prime.
It is a super-2 number, since 2×5505561432 = 606224133190072898, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 550556099 and 550556108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (550556243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 275278071 + 275278072.
It is an arithmetic number, because the mean of its divisors is an integer number (275278072).
Almost surely, 2550556143 is an apocalyptic number.
550556143 is a deficient number, since it is larger than the sum of its proper divisors (1).
550556143 is an equidigital number, since it uses as much as digits as its factorization.
550556143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45000, while the sum is 34.
The square root of 550556143 is about 23463.9328118711. The cubic root of 550556143 is about 819.5973350204.
The spelling of 550556143 in words is "five hundred fifty million, five hundred fifty-six thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •