Base | Representation |
---|---|
bin | 1001100000111101… |
… | …0011110011111101 |
3 | 20121000002021022101 |
4 | 2120033103303331 |
5 | 20212330301031 |
6 | 1101240145101 |
7 | 120202626604 |
oct | 23017236375 |
9 | 6530067271 |
10 | 2554150141 |
11 | 10a0829894 |
12 | 5b3468191 |
13 | 31920b85a |
14 | 1a3308a3b |
15 | ee375361 |
hex | 983d3cfd |
2554150141 has 2 divisors, whose sum is σ = 2554150142. Its totient is φ = 2554150140.
The previous prime is 2554150139. The next prime is 2554150153. The reversal of 2554150141 is 1410514552.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2380464100 + 173686041 = 48790^2 + 13179^2 .
It is a cyclic number.
It is not a de Polignac number, because 2554150141 - 21 = 2554150139 is a prime.
Together with 2554150139, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2554150111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1277075070 + 1277075071.
It is an arithmetic number, because the mean of its divisors is an integer number (1277075071).
Almost surely, 22554150141 is an apocalyptic number.
It is an amenable number.
2554150141 is a deficient number, since it is larger than the sum of its proper divisors (1).
2554150141 is an equidigital number, since it uses as much as digits as its factorization.
2554150141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4000, while the sum is 28.
The square root of 2554150141 is about 50538.6005049606. The cubic root of 2554150141 is about 1366.9379711697.
Adding to 2554150141 its reverse (1410514552), we get a palindrome (3964664693).
The spelling of 2554150141 in words is "two billion, five hundred fifty-four million, one hundred fifty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •