Base | Representation |
---|---|
bin | 110010000100011001… |
… | …100111010001000000 |
3 | 12010202200122102102100 |
4 | 302010121213101000 |
5 | 1340100243230441 |
6 | 40410350550400 |
7 | 3612150143022 |
oct | 620431472100 |
9 | 163680572370 |
10 | 53760914496 |
11 | 208886a8853 |
12 | a504508400 |
13 | 50b9ca0913 |
14 | 286000a012 |
15 | 15e9b3ecb6 |
hex | c84667440 |
53760914496 has 63 divisors (see below), whose sum is σ = 154111906533. Its totient is φ = 17918449920.
The previous prime is 53760914489. The next prime is 53760914507. The reversal of 53760914496 is 69441906735.
The square root of 53760914496 is 231864.
It is a perfect power (a square), and thus also a powerful number.
53760914496 is a `hidden beast` number, since 5 + 3 + 7 + 60 + 91 + 4 + 496 = 666.
It can be written as a sum of positive squares in only one way, i.e., 11128896 + 53749785600 = 3336^2 + 231840^2 .
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 8 ways as a sum of consecutive naturals, for example, 5559906 + ... + 5569566.
Almost surely, 253760914496 is an apocalyptic number.
53760914496 is the 231864-th square number.
It is an amenable number.
53760914496 is an abundant number, since it is smaller than the sum of its proper divisors (100350992037).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53760914496 is an frugal number, since it uses more digits than its factorization.
53760914496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19340 (or 9666 counting only the distinct ones).
The product of its (nonzero) digits is 4898880, while the sum is 54.
It can be divided in two parts, 53760 and 914496, that added together give a square (968256 = 9842).
The spelling of 53760914496 in words is "fifty-three billion, seven hundred sixty million, nine hundred fourteen thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •