Base | Representation |
---|---|
bin | 11000011001001011001010… |
… | …10000011001011101100101 |
3 | 21000221002012112012102001221 |
4 | 30030211211100121131211 |
5 | 24012330341102412112 |
6 | 310030330304220341 |
7 | 14204321333301412 |
oct | 1414454520313545 |
9 | 230832175172057 |
10 | 53641545357157 |
11 | 16101284a1607a |
12 | 602411100a6b1 |
13 | 23c14b7175c44 |
14 | d3639c2a1109 |
15 | 630516711e07 |
hex | 30c965419765 |
53641545357157 has 16 divisors (see below), whose sum is σ = 54158462668800. Its totient is φ = 53126119492992.
The previous prime is 53641545357133. The next prime is 53641545357173. The reversal of 53641545357157 is 75175354514635.
It is a cyclic number.
It is not a de Polignac number, because 53641545357157 - 227 = 53641411139429 is a prime.
It is a super-2 number, since 2×536415453571572 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 53641545357095 and 53641545357104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53641545357107) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1470701073 + ... + 1470737545.
It is an arithmetic number, because the mean of its divisors is an integer number (3384903916800).
Almost surely, 253641545357157 is an apocalyptic number.
It is an amenable number.
53641545357157 is a deficient number, since it is larger than the sum of its proper divisors (516917311643).
53641545357157 is a wasteful number, since it uses less digits than its factorization.
53641545357157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56532.
The product of its digits is 132300000, while the sum is 61.
The spelling of 53641545357157 in words is "fifty-three trillion, six hundred forty-one billion, five hundred forty-five million, three hundred fifty-seven thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •