Base | Representation |
---|---|
bin | 1100101000101… |
… | …0011100001100 |
3 | 10200201110122100 |
4 | 3022022130030 |
5 | 102031331402 |
6 | 5131515100 |
7 | 1212312600 |
oct | 312123414 |
9 | 120643570 |
10 | 52995852 |
11 | 27a07628 |
12 | 158b8a90 |
13 | ac96bc0 |
14 | 7077500 |
15 | 49bc71c |
hex | 328a70c |
52995852 has 108 divisors (see below), whose sum is σ = 167892816. Its totient is φ = 13970880.
The previous prime is 52995829. The next prime is 52995857. The reversal of 52995852 is 25859925.
It is a junction number, because it is equal to n+sod(n) for n = 52995798 and 52995807.
It is not an unprimeable number, because it can be changed into a prime (52995857) 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 35 ways as a sum of consecutive naturals, for example, 21777 + ... + 24087.
Almost surely, 252995852 is an apocalyptic number.
52995852 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 52995852, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (83946408).
52995852 is an abundant number, since it is smaller than the sum of its proper divisors (114896964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52995852 is a wasteful number, since it uses less digits than its factorization.
52995852 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2348 (or 2336 counting only the distinct ones).
The product of its digits is 324000, while the sum is 45.
The square root of 52995852 is about 7279.8249978966. The cubic root of 52995852 is about 375.6187757493.
The spelling of 52995852 in words is "fifty-two million, nine hundred ninety-five thousand, eight hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •