Base | Representation |
---|---|
bin | 1001011110111111… |
… | …1000100101001101 |
3 | 20120102120201220021 |
4 | 2113233320211031 |
5 | 20203223142031 |
6 | 1100343422141 |
7 | 120042616243 |
oct | 22757704515 |
9 | 6512521807 |
10 | 2545912141 |
11 | 1097112523 |
12 | 5b0754951 |
13 | 3175b5cb6 |
14 | 1a21a2793 |
15 | ed799511 |
hex | 97bf894d |
2545912141 has 2 divisors, whose sum is σ = 2545912142. Its totient is φ = 2545912140.
The previous prime is 2545912139. The next prime is 2545912147. The reversal of 2545912141 is 1412195452.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2157230916 + 388681225 = 46446^2 + 19715^2 .
It is a cyclic number.
It is not a de Polignac number, because 2545912141 - 21 = 2545912139 is a prime.
Together with 2545912139, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 2545912097 and 2545912106.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2545912147) 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, 1272956070 + 1272956071.
It is an arithmetic number, because the mean of its divisors is an integer number (1272956071).
Almost surely, 22545912141 is an apocalyptic number.
It is an amenable number.
2545912141 is a deficient number, since it is larger than the sum of its proper divisors (1).
2545912141 is an equidigital number, since it uses as much as digits as its factorization.
2545912141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14400, while the sum is 34.
The square root of 2545912141 is about 50457.0326218259. The cubic root of 2545912141 is about 1365.4667755607.
The spelling of 2545912141 in words is "two billion, five hundred forty-five million, nine hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •