Base | Representation |
---|---|
bin | 1001010011000000… |
… | …0100001100010101 |
3 | 20102220222001002122 |
4 | 2110300010030111 |
5 | 20102340044203 |
6 | 1051345545325 |
7 | 115562326352 |
oct | 22460041425 |
9 | 6386861078 |
10 | 2495628053 |
11 | 1070798326 |
12 | 597945245 |
13 | 30a05b4b9 |
14 | 199633629 |
15 | e9165538 |
hex | 94c04315 |
2495628053 has 2 divisors, whose sum is σ = 2495628054. Its totient is φ = 2495628052.
The previous prime is 2495628029. The next prime is 2495628073. The reversal of 2495628053 is 3508265942.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2254540324 + 241087729 = 47482^2 + 15527^2 .
It is a cyclic number.
It is not a de Polignac number, because 2495628053 - 214 = 2495611669 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2495627995 and 2495628013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2495628073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1247814026 + 1247814027.
It is an arithmetic number, because the mean of its divisors is an integer number (1247814027).
Almost surely, 22495628053 is an apocalyptic number.
It is an amenable number.
2495628053 is a deficient number, since it is larger than the sum of its proper divisors (1).
2495628053 is an equidigital number, since it uses as much as digits as its factorization.
2495628053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 518400, while the sum is 44.
The square root of 2495628053 is about 49956.2613993481. The cubic root of 2495628053 is about 1356.4171940015.
The spelling of 2495628053 in words is "two billion, four hundred ninety-five million, six hundred twenty-eight thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •