Base | Representation |
---|---|
bin | 110001011001001000… |
… | …111001001011010101 |
3 | 12001220002220210101000 |
4 | 301121020321023111 |
5 | 1332103442024000 |
6 | 40210342253513 |
7 | 3555155002143 |
oct | 613110711325 |
9 | 161802823330 |
10 | 53035111125 |
11 | 20545a34a57 |
12 | a341427299 |
13 | 50027c8779 |
14 | 27d1876593 |
15 | 15a6072000 |
hex | c592392d5 |
53035111125 has 128 divisors (see below), whose sum is σ = 99632332800. Its totient is φ = 27834048000.
The previous prime is 53035111079. The next prime is 53035111127. The reversal of 53035111125 is 52111153035.
53035111125 is a `hidden beast` number, since 5 + 30 + 3 + 511 + 112 + 5 = 666.
It is not a de Polignac number, because 53035111125 - 211 = 53035109077 is a prime.
It is a super-3 number, since 3×530351111253 (a number of 33 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53035111127) 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 in 127 ways as a sum of consecutive naturals, for example, 115043395 + ... + 115043855.
It is an arithmetic number, because the mean of its divisors is an integer number (778377600).
Almost surely, 253035111125 is an apocalyptic number.
It is an amenable number.
53035111125 is a deficient number, since it is larger than the sum of its proper divisors (46597221675).
53035111125 is a wasteful number, since it uses less digits than its factorization.
53035111125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 957 (or 941 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 27.
The spelling of 53035111125 in words is "fifty-three billion, thirty-five million, one hundred eleven thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •