Base | Representation |
---|---|
bin | 10011001001111010101000 |
3 | 100110010000000 |
4 | 103021322220 |
5 | 2241140402 |
6 | 255343000 |
7 | 60452340 |
oct | 23117250 |
9 | 10403000 |
10 | 5021352 |
11 | 291a686 |
12 | 1821a60 |
13 | 106a71b |
14 | 949d20 |
15 | 692c1c |
hex | 4c9ea8 |
5021352 has 128 divisors (see below), whose sum is σ = 16531200. Its totient is φ = 1399680.
The previous prime is 5021351. The next prime is 5021363. The reversal of 5021352 is 2531205.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (5021351) 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 31 ways as a sum of consecutive naturals, for example, 122452 + ... + 122492.
It is an arithmetic number, because the mean of its divisors is an integer number (129150).
Almost surely, 25021352 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 5021352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8265600).
5021352 is an abundant number, since it is smaller than the sum of its proper divisors (11509848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5021352 is an equidigital number, since it uses as much as digits as its factorization.
5021352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75 (or 53 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 18.
The square root of 5021352 is about 2240.8373434946. The cubic root of 5021352 is about 171.2406583783.
Adding to 5021352 its reverse (2531205), we get a palindrome (7552557).
The spelling of 5021352 in words is "five million, twenty-one thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •