Base | Representation |
---|---|
bin | 110001011010010101… |
… | …111111010010011000 |
3 | 12001221111221120102210 |
4 | 301122111333102120 |
5 | 1332124130234430 |
6 | 40212343355120 |
7 | 3555521534565 |
oct | 613225772230 |
9 | 161844846383 |
10 | 53055321240 |
11 | 20556389129 |
12 | a348152aa0 |
13 | 5006a5370c |
14 | 27d441786c |
15 | 15a7c152b0 |
hex | c5a57f498 |
53055321240 has 64 divisors (see below), whose sum is σ = 162867513600. Its totient is φ = 13819059072.
The previous prime is 53055321239. The next prime is 53055321271. The reversal of 53055321240 is 4212355035.
It is a super-2 number, since 2×530553212402 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 53055321198 and 53055321207.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 5135860 + ... + 5146179.
It is an arithmetic number, because the mean of its divisors is an integer number (2544804900).
Almost surely, 253055321240 is an apocalyptic number.
It is an amenable number.
53055321240 is an abundant number, since it is smaller than the sum of its proper divisors (109812192360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53055321240 is a wasteful number, since it uses less digits than its factorization.
53055321240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10282096 (or 10282092 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 30.
Adding to 53055321240 its reverse (4212355035), we get a palindrome (57267676275).
The spelling of 53055321240 in words is "fifty-three billion, fifty-five million, three hundred twenty-one thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •