Base | Representation |
---|---|
bin | 110001011101000101… |
… | …001010011100010101 |
3 | 12002001201100121001121 |
4 | 301131011022130111 |
5 | 1332222404222013 |
6 | 40221103523541 |
7 | 3556620053002 |
oct | 613505123425 |
9 | 162051317047 |
10 | 53101242133 |
11 | 2057a2a3185 |
12 | a35b5b95b1 |
13 | 5013411244 |
14 | 27da56c8a9 |
15 | 15abc8658d |
hex | c5d14a715 |
53101242133 has 2 divisors, whose sum is σ = 53101242134. Its totient is φ = 53101242132.
The previous prime is 53101242107. The next prime is 53101242163. The reversal of 53101242133 is 33124210135.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 52535848849 + 565393284 = 229207^2 + 23778^2 .
It is a cyclic number.
It is not a de Polignac number, because 53101242133 - 29 = 53101241621 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53101242098 and 53101242107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53101242163) 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, 26550621066 + 26550621067.
It is an arithmetic number, because the mean of its divisors is an integer number (26550621067).
Almost surely, 253101242133 is an apocalyptic number.
It is an amenable number.
53101242133 is a deficient number, since it is larger than the sum of its proper divisors (1).
53101242133 is an equidigital number, since it uses as much as digits as its factorization.
53101242133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 53101242133 its reverse (33124210135), we get a palindrome (86225452268).
The spelling of 53101242133 in words is "fifty-three billion, one hundred one million, two hundred forty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •