Base | Representation |
---|---|
bin | 11000101011001100010100… |
… | …01111000000010101000000 |
3 | 21010010021012100221122110000 |
4 | 30111212022033000111000 |
5 | 24103001243101232210 |
6 | 311222554441240000 |
7 | 14300126160623265 |
oct | 1425461217002500 |
9 | 233107170848400 |
10 | 54260641039680 |
11 | 1631a899327579 |
12 | 61040aaa93000 |
13 | 24379ab03247a |
14 | d5832c6a926c |
15 | 64169cc19ac0 |
hex | 31598a3c0540 |
54260641039680 has 140 divisors (see below), whose sum is σ = 193014646123860. Its totient is φ = 14469504270336.
The previous prime is 54260641039637. The next prime is 54260641039697. The reversal of 54260641039680 is 8693014606245.
54260641039680 is a `hidden beast` number, since 5 + 4 + 2 + 60 + 6 + 410 + 3 + 96 + 80 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 18279934454016 + 35980706585664 = 4275504^2 + 5998392^2 .
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1046668545 + ... + 1046720384.
Almost surely, 254260641039680 is an apocalyptic number.
It is an amenable number.
54260641039680 is an abundant number, since it is smaller than the sum of its proper divisors (138754005084180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54260641039680 is a wasteful number, since it uses less digits than its factorization.
54260641039680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2093388958 (or 2093388939 counting only the distinct ones).
The product of its (nonzero) digits is 7464960, while the sum is 54.
The spelling of 54260641039680 in words is "fifty-four trillion, two hundred sixty billion, six hundred forty-one million, thirty-nine thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •