Base | Representation |
---|---|
bin | 110001011001101100… |
… | …011100101010101101 |
3 | 12001220202110022120022 |
4 | 301121230130222231 |
5 | 1332113333302113 |
6 | 40211314131525 |
7 | 3555330141302 |
oct | 613154345255 |
9 | 161822408508 |
10 | 53044431533 |
11 | 20550220575 |
12 | a344580ba5 |
13 | 500470cbc2 |
14 | 27d2bc10a9 |
15 | 15a6cb3908 |
hex | c59b1caad |
53044431533 has 8 divisors (see below), whose sum is σ = 54373440000. Its totient is φ = 51719760288.
The previous prime is 53044431527. The next prime is 53044431563. The reversal of 53044431533 is 33513444035.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 53044431533 - 26 = 53044431469 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 53044431493 and 53044431502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53044431523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1059533 + ... + 1108466.
It is an arithmetic number, because the mean of its divisors is an integer number (6796680000).
Almost surely, 253044431533 is an apocalyptic number.
It is an amenable number.
53044431533 is a deficient number, since it is larger than the sum of its proper divisors (1329008467).
53044431533 is a wasteful number, since it uses less digits than its factorization.
53044431533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2168611.
The product of its (nonzero) digits is 129600, while the sum is 35.
Adding to 53044431533 its reverse (33513444035), we get a palindrome (86557875568).
The spelling of 53044431533 in words is "fifty-three billion, forty-four million, four hundred thirty-one thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •