Base | Representation |
---|---|
bin | 1100101000111… |
… | …1100011000000 |
3 | 10200202112100000 |
4 | 3022033203000 |
5 | 102033014033 |
6 | 5132200000 |
7 | 1212430560 |
oct | 312174300 |
9 | 120675300 |
10 | 53016768 |
11 | 27a21312 |
12 | 15909000 |
13 | aca358c |
14 | 7080da0 |
15 | 49c3a13 |
hex | 328f8c0 |
53016768 has 168 divisors, whose sum is σ = 180474112. Its totient is φ = 15116544.
The previous prime is 53016767. The next prime is 53016781. The reversal of 53016768 is 86761035.
53016768 is a `hidden beast` number, since 530 + 1 + 67 + 68 = 666.
It is a tau number, because it is divible by the number of its divisors (168).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (53016767) 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 23 ways as a sum of consecutive naturals, for example, 108621 + ... + 109107.
Almost surely, 253016768 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 53016768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (90237056).
53016768 is an abundant number, since it is smaller than the sum of its proper divisors (127457344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53016768 is an equidigital number, since it uses as much as digits as its factorization.
53016768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 521 (or 499 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The square root of 53016768 is about 7281.2614291756. The cubic root of 53016768 is about 375.6681847041.
The spelling of 53016768 in words is "fifty-three million, sixteen thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •