Base | Representation |
---|---|
bin | 10011010001100101011010 |
3 | 100111201002100 |
4 | 103101211122 |
5 | 2243142022 |
6 | 300144230 |
7 | 60643041 |
oct | 23214532 |
9 | 10451070 |
10 | 5052762 |
11 | 2941240 |
12 | 1838076 |
13 | 107bb00 |
14 | 957558 |
15 | 69c1ac |
hex | 4d195a |
5052762 has 72 divisors (see below), whose sum is σ = 13017888. Its totient is φ = 1404000.
The previous prime is 5052743. The next prime is 5052763. The reversal of 5052762 is 2672505.
It is not an unprimeable number, because it can be changed into a prime (5052763) 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, 33387 + ... + 33537.
It is an arithmetic number, because the mean of its divisors is an integer number (180804).
Almost surely, 25052762 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5052762, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6508944).
5052762 is an abundant number, since it is smaller than the sum of its proper divisors (7965126).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5052762 is a wasteful number, since it uses less digits than its factorization.
5052762 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196 (or 180 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The square root of 5052762 is about 2247.8349583544. The cubic root of 5052762 is about 171.5969696435.
The spelling of 5052762 in words is "five million, fifty-two thousand, seven hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •