Base | Representation |
---|---|
bin | 1100011010001… |
… | …0101100101000 |
3 | 10121221020120001 |
4 | 3012202230220 |
5 | 101310443012 |
6 | 5055312344 |
7 | 1201250311 |
oct | 306425450 |
9 | 117836501 |
10 | 52046632 |
11 | 27419450 |
12 | 1551b6b4 |
13 | aa23b31 |
14 | 6cab608 |
15 | 4881357 |
hex | 31a2b28 |
52046632 has 32 divisors (see below), whose sum is σ = 107320320. Its totient is φ = 23466240.
The previous prime is 52046629. The next prime is 52046633. The reversal of 52046632 is 23664025.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 52046632.
It is not an unprimeable number, because it can be changed into a prime (52046633) 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, 8848 + ... + 13504.
It is an arithmetic number, because the mean of its divisors is an integer number (3353760).
Almost surely, 252046632 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 52046632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (53660160).
52046632 is an abundant number, since it is smaller than the sum of its proper divisors (55273688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52046632 is a wasteful number, since it uses less digits than its factorization.
52046632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4801 (or 4797 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 28.
The square root of 52046632 is about 7214.3351738050. The cubic root of 52046632 is about 373.3626557184.
The spelling of 52046632 in words is "fifty-two million, forty-six thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •