Base | Representation |
---|---|
bin | 1001011111111110… |
… | …1011100100010101 |
3 | 20120201101010021122 |
4 | 2113333223210111 |
5 | 20210303200031 |
6 | 1101012253325 |
7 | 120123044156 |
oct | 22777534425 |
9 | 6521333248 |
10 | 2550053141 |
11 | 1099490739 |
12 | 5b2011245 |
13 | 318405aac |
14 | 1a295d92d |
15 | edd1647b |
hex | 97feb915 |
2550053141 has 2 divisors, whose sum is σ = 2550053142. Its totient is φ = 2550053140.
The previous prime is 2550053083. The next prime is 2550053167. The reversal of 2550053141 is 1413500552.
It is an a-pointer prime, because the next prime (2550053167) can be obtained adding 2550053141 to its sum of digits (26).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2109473041 + 440580100 = 45929^2 + 20990^2 .
It is a cyclic number.
It is not a de Polignac number, because 2550053141 - 214 = 2550036757 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2550053141.
It is a congruent number.
It is a weakly prime.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1275026570 + 1275026571.
It is an arithmetic number, because the mean of its divisors is an integer number (1275026571).
Almost surely, 22550053141 is an apocalyptic number.
It is an amenable number.
2550053141 is a deficient number, since it is larger than the sum of its proper divisors (1).
2550053141 is an equidigital number, since it uses as much as digits as its factorization.
2550053141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3000, while the sum is 26.
The square root of 2550053141 is about 50498.0508633749. The cubic root of 2550053141 is about 1366.2066983193.
Adding to 2550053141 its reverse (1413500552), we get a palindrome (3963553693).
The spelling of 2550053141 in words is "two billion, five hundred fifty million, fifty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •