Base | Representation |
---|---|
bin | 1001011110110011… |
… | …1101000011100001 |
3 | 20120101010201020211 |
4 | 2113230331003201 |
5 | 20203024102113 |
6 | 1100315134121 |
7 | 120033236665 |
oct | 22754750341 |
9 | 6511121224 |
10 | 2545144033 |
11 | 1096738423 |
12 | 5b0444341 |
13 | 3173a74b3 |
14 | 1a20428a5 |
15 | ed696b3d |
hex | 97b3d0e1 |
2545144033 has 2 divisors, whose sum is σ = 2545144034. Its totient is φ = 2545144032.
The previous prime is 2545144013. The next prime is 2545144039. The reversal of 2545144033 is 3304415452.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1984969809 + 560174224 = 44553^2 + 23668^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2545144033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2545143986 and 2545144004.
It is not a weakly prime, because it can be changed into another prime (2545144039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1272572016 + 1272572017.
It is an arithmetic number, because the mean of its divisors is an integer number (1272572017).
Almost surely, 22545144033 is an apocalyptic number.
It is an amenable number.
2545144033 is a deficient number, since it is larger than the sum of its proper divisors (1).
2545144033 is an equidigital number, since it uses as much as digits as its factorization.
2545144033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28800, while the sum is 31.
The square root of 2545144033 is about 50449.4205417664. The cubic root of 2545144033 is about 1365.3294401786.
Adding to 2545144033 its reverse (3304415452), we get a palindrome (5849559485).
The spelling of 2545144033 in words is "two billion, five hundred forty-five million, one hundred forty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •