Base | Representation |
---|---|
bin | 110001011000010110… |
… | …011000010000000000 |
3 | 12001212012000000200000 |
4 | 301120112120100000 |
5 | 1332042044302211 |
6 | 40205150400000 |
7 | 3554634310422 |
oct | 613026302000 |
9 | 161765000600 |
10 | 53021869056 |
11 | 2053950aaa2 |
12 | a338b00000 |
13 | 4cccb40320 |
14 | 27cdbca812 |
15 | 15a4d08656 |
hex | c58598400 |
53021869056 has 528 divisors, whose sum is σ = 176000470464. Its totient is φ = 15837659136.
The previous prime is 53021869039. The next prime is 53021869057. The reversal of 53021869056 is 65096812035.
53021869056 is a `hidden beast` number, since 530 + 2 + 1 + 8 + 69 + 0 + 56 = 666.
It is a super-2 number, since 2×530218690562 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (53021869057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 119687971 + ... + 119688413.
Almost surely, 253021869056 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 53021869056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (88000235232).
53021869056 is an abundant number, since it is smaller than the sum of its proper divisors (122978601408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53021869056 is a wasteful number, since it uses less digits than its factorization.
53021869056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528 (or 498 counting only the distinct ones).
The product of its (nonzero) digits is 388800, while the sum is 45.
The spelling of 53021869056 in words is "fifty-three billion, twenty-one million, eight hundred sixty-nine thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •