Base | Representation |
---|---|
bin | 11000111101101001011111… |
… | …00110001001100101100100 |
3 | 21012100220000021212222121100 |
4 | 30132310233212021211210 |
5 | 24143344000014240233 |
6 | 312430151200320100 |
7 | 14364005466140202 |
oct | 1436645746114544 |
9 | 235326007788540 |
10 | 54894775540068 |
11 | 1654481a763472 |
12 | 61a6b85313030 |
13 | 248272a7a94a9 |
14 | d7acc8120072 |
15 | 652e14653813 |
hex | 31ed2f989964 |
54894775540068 has 144 divisors (see below), whose sum is σ = 143508768282880. Its totient is φ = 17679288096000.
The previous prime is 54894775540037. The next prime is 54894775540091. The reversal of 54894775540068 is 86004557749845.
54894775540068 is a `hidden beast` number, since 5 + 4 + 8 + 9 + 4 + 7 + 7 + 554 + 0 + 0 + 68 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 54894775539978 and 54894775540005.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 561310518 + ... + 561408306.
Almost surely, 254894775540068 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 54894775540068, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71754384141440).
54894775540068 is an abundant number, since it is smaller than the sum of its proper divisors (88613992742812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54894775540068 is a wasteful number, since it uses less digits than its factorization.
54894775540068 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100778 (or 100773 counting only the distinct ones).
The product of its (nonzero) digits is 1354752000, while the sum is 72.
The spelling of 54894775540068 in words is "fifty-four trillion, eight hundred ninety-four billion, seven hundred seventy-five million, five hundred forty thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •