Base | Representation |
---|---|
bin | 1100100000110… |
… | …0101110100100 |
3 | 10122202022022020 |
4 | 3020030232210 |
5 | 101413342212 |
6 | 5112503140 |
7 | 1205036430 |
oct | 310145644 |
9 | 118668266 |
10 | 52480932 |
11 | 27695779 |
12 | 156aaab0 |
13 | ab4670a |
14 | 6d819c0 |
15 | 4919d8c |
hex | 320cba4 |
52480932 has 48 divisors (see below), whose sum is σ = 141281280. Its totient is φ = 14851872.
The previous prime is 52480927. The next prime is 52480933. The reversal of 52480932 is 23908425.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 52480893 and 52480902.
It is not an unprimeable number, because it can be changed into a prime (52480933) 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 15 ways as a sum of consecutive naturals, for example, 6069 + ... + 11907.
It is an arithmetic number, because the mean of its divisors is an integer number (2943360).
Almost surely, 252480932 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 52480932, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (70640640).
52480932 is an abundant number, since it is smaller than the sum of its proper divisors (88800348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52480932 is a wasteful number, since it uses less digits than its factorization.
52480932 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5960 (or 5958 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 33.
The square root of 52480932 is about 7244.3724365883. The cubic root of 52480932 is about 374.3982812307.
The spelling of 52480932 in words is "fifty-two million, four hundred eighty thousand, nine hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •