Base | Representation |
---|---|
bin | 11000001010100111011001… |
… | …00000110111100001001101 |
3 | 20222011020222210202021102220 |
4 | 30011103230200313201031 |
5 | 23431131342134100401 |
6 | 305004435555405553 |
7 | 14123222016111543 |
oct | 1405235440674115 |
9 | 228136883667386 |
10 | 53141303425101 |
11 | 15a29111435531 |
12 | 5b63182bb38b9 |
13 | 2386284b7bb08 |
14 | d1a0a4ca1d93 |
15 | 6224d9740336 |
hex | 3054ec83784d |
53141303425101 has 4 divisors (see below), whose sum is σ = 70855071233472. Its totient is φ = 35427535616732.
The previous prime is 53141303425081. The next prime is 53141303425109. The reversal of 53141303425101 is 10152430314135.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 53141303425101 - 25 = 53141303425069 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53141303425109) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8856883904181 + ... + 8856883904186.
It is an arithmetic number, because the mean of its divisors is an integer number (17713767808368).
Almost surely, 253141303425101 is an apocalyptic number.
It is an amenable number.
53141303425101 is a deficient number, since it is larger than the sum of its proper divisors (17713767808371).
53141303425101 is a wasteful number, since it uses less digits than its factorization.
53141303425101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17713767808370.
The product of its (nonzero) digits is 21600, while the sum is 33.
Adding to 53141303425101 its reverse (10152430314135), we get a palindrome (63293733739236).
The spelling of 53141303425101 in words is "fifty-three trillion, one hundred forty-one billion, three hundred three million, four hundred twenty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •