Base | Representation |
---|---|
bin | 1100110011101… |
… | …0011001011100 |
3 | 10202002002021200 |
4 | 3030322121130 |
5 | 102222412242 |
6 | 5155155500 |
7 | 1221404040 |
oct | 314723134 |
9 | 122062250 |
10 | 53716572 |
11 | 2835a068 |
12 | 15ba5b90 |
13 | b189c70 |
14 | 71c4020 |
15 | 4ab104c |
hex | 333a65c |
53716572 has 144 divisors (see below), whose sum is σ = 176117760. Its totient is φ = 13405824.
The previous prime is 53716571. The next prime is 53716627. The reversal of 53716572 is 27561735.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53716571) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 61813 + ... + 62675.
It is an arithmetic number, because the mean of its divisors is an integer number (1223040).
Almost surely, 253716572 is an apocalyptic number.
53716572 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 53716572, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (88058880).
53716572 is an abundant number, since it is smaller than the sum of its proper divisors (122401188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53716572 is a wasteful number, since it uses less digits than its factorization.
53716572 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 912 (or 907 counting only the distinct ones).
The product of its digits is 44100, while the sum is 36.
The square root of 53716572 is about 7329.1590240627. The cubic root of 53716572 is about 377.3138640567.
The spelling of 53716572 in words is "fifty-three million, seven hundred sixteen thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •