Base | Representation |
---|---|
bin | 100110010001101110010… |
… | …1111111110001011000001 |
3 | 200121220220021002000112022 |
4 | 1030203130233332023001 |
5 | 1142143000321030444 |
6 | 15104430251211225 |
7 | 1052035062140231 |
oct | 114433457761301 |
9 | 20556807060468 |
10 | 5260743533249 |
11 | 1749083639306 |
12 | 70b698446b15 |
13 | 2c2116bb2809 |
14 | 14289ad87cc1 |
15 | 91c9d8199ee |
hex | 4c8dcbfe2c1 |
5260743533249 has 2 divisors, whose sum is σ = 5260743533250. Its totient is φ = 5260743533248.
The previous prime is 5260743533237. The next prime is 5260743533299. The reversal of 5260743533249 is 9423353470625.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5241535513600 + 19208019649 = 2289440^2 + 138593^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5260743533249 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5260743533249.
It is not a weakly prime, because it can be changed into another prime (5260743533299) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2630371766624 + 2630371766625.
It is an arithmetic number, because the mean of its divisors is an integer number (2630371766625).
Almost surely, 25260743533249 is an apocalyptic number.
It is an amenable number.
5260743533249 is a deficient number, since it is larger than the sum of its proper divisors (1).
5260743533249 is an equidigital number, since it uses as much as digits as its factorization.
5260743533249 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16329600, while the sum is 53.
The spelling of 5260743533249 in words is "five trillion, two hundred sixty billion, seven hundred forty-three million, five hundred thirty-three thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •