Base | Representation |
---|---|
bin | 110001011010101110… |
… | …001000000001100000 |
3 | 12001221221212000210000 |
4 | 301122232020001200 |
5 | 1332132240222410 |
6 | 40213131140000 |
7 | 3555626366421 |
oct | 613256100140 |
9 | 161857760700 |
10 | 53061648480 |
11 | 20559a0a955 |
12 | a34a2a4600 |
13 | 500815a649 |
14 | 27d51c3648 |
15 | 15a8564dc0 |
hex | c5ab88060 |
53061648480 has 720 divisors, whose sum is σ = 205793191296. Its totient is φ = 12859637760.
The previous prime is 53061648467. The next prime is 53061648503. The reversal of 53061648480 is 8484616035.
53061648480 is a `hidden beast` number, since 5 + 3 + 0 + 6 + 164 + 8 + 480 = 666.
It is a tau number, because it is divible by the number of its divisors (720).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 116108412 + ... + 116108868.
Almost surely, 253061648480 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 53061648480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (102896595648).
53061648480 is an abundant number, since it is smaller than the sum of its proper divisors (152731542816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53061648480 is a wasteful number, since it uses less digits than its factorization.
53061648480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 549 (or 515 counting only the distinct ones).
The product of its (nonzero) digits is 552960, while the sum is 45.
The spelling of 53061648480 in words is "fifty-three billion, sixty-one million, six hundred forty-eight thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •