Base | Representation |
---|---|
bin | 110001011101001101… |
… | …110101011000000111 |
3 | 12002001212122002001011 |
4 | 301131031311120013 |
5 | 1332223444441033 |
6 | 40221224343051 |
7 | 3556645300600 |
oct | 613515653007 |
9 | 162055562034 |
10 | 53103515143 |
11 | 205806059a8 |
12 | a360314a87 |
13 | 5013a28a13 |
14 | 27da9a0da7 |
15 | 15ac084ccd |
hex | c5d375607 |
53103515143 has 48 divisors (see below), whose sum is σ = 65015141184. Its totient is φ = 43203041280.
The previous prime is 53103515099. The next prime is 53103515147. The reversal of 53103515143 is 34151530135.
It is a de Polignac number, because none of the positive numbers 2k-53103515143 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53103515147) 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 47 ways as a sum of consecutive naturals, for example, 12484005 + ... + 12488257.
It is an arithmetic number, because the mean of its divisors is an integer number (1354482108).
Almost surely, 253103515143 is an apocalyptic number.
53103515143 is a deficient number, since it is larger than the sum of its proper divisors (11911626041).
53103515143 is a wasteful number, since it uses less digits than its factorization.
53103515143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4472 (or 4465 counting only the distinct ones).
The product of its (nonzero) digits is 13500, while the sum is 31.
The spelling of 53103515143 in words is "fifty-three billion, one hundred three million, five hundred fifteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •