Base | Representation |
---|---|
bin | 1100011101010… |
… | …1100101000000 |
3 | 10122022211102212 |
4 | 3013111211000 |
5 | 101334130130 |
6 | 5104001252 |
7 | 1203106025 |
oct | 307254500 |
9 | 118284385 |
10 | 52255040 |
11 | 27550a92 |
12 | 15600228 |
13 | aa97956 |
14 | 6d2354c |
15 | 48c2e95 |
hex | 31d5940 |
52255040 has 56 divisors (see below), whose sum is σ = 126519432. Its totient is φ = 20551680.
The previous prime is 52255031. The next prime is 52255043. The reversal of 52255040 is 4055225.
It can be written as a sum of positive squares in 4 ways, for example, as 4700224 + 47554816 = 2168^2 + 6896^2 .
It is a junction number, because it is equal to n+sod(n) for n = 52254997 and 52255015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52255043) 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 7 ways as a sum of consecutive naturals, for example, 18182 + ... + 20858.
Almost surely, 252255040 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 52255040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (63259716).
52255040 is an abundant number, since it is smaller than the sum of its proper divisors (74264392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52255040 is a wasteful number, since it uses less digits than its factorization.
52255040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2755 (or 2745 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 23.
The square root of 52255040 is about 7228.7647630837. The cubic root of 52255040 is about 373.8603384849.
The spelling of 52255040 in words is "fifty-two million, two hundred fifty-five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •