Base | Representation |
---|---|
bin | 110001011001101011… |
… | …110000110100100101 |
3 | 12001220202010012012202 |
4 | 301121223300310211 |
5 | 1332113312030231 |
6 | 40211310224245 |
7 | 3555325462562 |
oct | 613153606445 |
9 | 161822105182 |
10 | 53044251941 |
11 | 2055010864a |
12 | a3444b5085 |
13 | 5004679235 |
14 | 27d2b75869 |
15 | 15a6c7a5cb |
hex | c59af0d25 |
53044251941 has 2 divisors, whose sum is σ = 53044251942. Its totient is φ = 53044251940.
The previous prime is 53044251907. The next prime is 53044251971. The reversal of 53044251941 is 14915244035.
53044251941 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 50931011041 + 2113240900 = 225679^2 + 45970^2 .
It is a cyclic number.
It is not a de Polignac number, because 53044251941 - 226 = 52977143077 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53044251895 and 53044251904.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53044251971) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26522125970 + 26522125971.
It is an arithmetic number, because the mean of its divisors is an integer number (26522125971).
Almost surely, 253044251941 is an apocalyptic number.
It is an amenable number.
53044251941 is a deficient number, since it is larger than the sum of its proper divisors (1).
53044251941 is an equidigital number, since it uses as much as digits as its factorization.
53044251941 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 86400, while the sum is 38.
Adding to 53044251941 its reverse (14915244035), we get a palindrome (67959495976).
The spelling of 53044251941 in words is "fifty-three billion, forty-four million, two hundred fifty-one thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •