Base | Representation |
---|---|
bin | 11000111100000100101001… |
… | …11110001110110010111000 |
3 | 21012011201021121122212212010 |
4 | 30132002110332032302320 |
5 | 24142002113243324244 |
6 | 312345235410045520 |
7 | 14360051140554441 |
oct | 1436022476166270 |
9 | 235151247585763 |
10 | 54840641776824 |
11 | 16523870654962 |
12 | 6198597b798a0 |
13 | 247a5b14b2717 |
14 | d784307ba2c8 |
15 | 6517e6e14eb9 |
hex | 31e094f8ecb8 |
54840641776824 has 32 divisors (see below), whose sum is σ = 137102759698320. Its totient is φ = 18280059891456.
The previous prime is 54840641776769. The next prime is 54840641776831. The reversal of 54840641776824 is 42867714604845.
It is a happy number.
54840641776824 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (66) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6701419 + ... + 12433434.
Almost surely, 254840641776824 is an apocalyptic number.
It is an amenable number.
54840641776824 is an abundant number, since it is smaller than the sum of its proper divisors (82262117921496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54840641776824 is a wasteful number, since it uses less digits than its factorization.
54840641776824 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19254279 (or 19254275 counting only the distinct ones).
The product of its (nonzero) digits is 289013760, while the sum is 66.
The spelling of 54840641776824 in words is "fifty-four trillion, eight hundred forty billion, six hundred forty-one million, seven hundred seventy-six thousand, eight hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.036 sec. • engine limits •