Base | Representation |
---|---|
bin | 110001100011100100… |
… | …110111001011100101 |
3 | 12002100022101222220221 |
4 | 301203210313023211 |
5 | 1332433303341031 |
6 | 40235555324341 |
7 | 3562412236366 |
oct | 614344671345 |
9 | 162308358827 |
10 | 53210215141 |
11 | 20625863216 |
12 | a38bbb06b1 |
13 | 502cb77005 |
14 | 280ac17b6d |
15 | 15b660ea11 |
hex | c639372e5 |
53210215141 has 8 divisors (see below), whose sum is σ = 56013180480. Its totient is φ = 50407492608.
The previous prime is 53210215129. The next prime is 53210215159. The reversal of 53210215141 is 14151201235.
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 53210215141 - 213 = 53210206949 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53210215111) 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, 543360 + ... + 633766.
It is an arithmetic number, because the mean of its divisors is an integer number (7001647560).
Almost surely, 253210215141 is an apocalyptic number.
It is an amenable number.
53210215141 is a deficient number, since it is larger than the sum of its proper divisors (2802965339).
53210215141 is a wasteful number, since it uses less digits than its factorization.
53210215141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121403.
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 53210215141 its reverse (14151201235), we get a palindrome (67361416376).
The spelling of 53210215141 in words is "fifty-three billion, two hundred ten million, two hundred fifteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •