Base | Representation |
---|---|
bin | 10100000001110110000000 |
3 | 100212202020110 |
4 | 110001312000 |
5 | 2321003212 |
6 | 304311320 |
7 | 62425245 |
oct | 24016600 |
9 | 10782213 |
10 | 5250432 |
11 | 2a66800 |
12 | 1912540 |
13 | 111aa85 |
14 | 9a95cc |
15 | 6daa3c |
hex | 501d80 |
5250432 has 96 divisors (see below), whose sum is σ = 15465240. Its totient is φ = 1576960.
The previous prime is 5250409. The next prime is 5250437. The reversal of 5250432 is 2340525.
It is a tau number, because it is divible by the number of its divisors (96).
It is a junction number, because it is equal to n+sod(n) for n = 5250399 and 5250408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5250437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 46408 + ... + 46520.
Almost surely, 25250432 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 5250432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7732620).
5250432 is an abundant number, since it is smaller than the sum of its proper divisors (10214808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5250432 is a wasteful number, since it uses less digits than its factorization.
5250432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152 (or 129 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 21.
The square root of 5250432 is about 2291.3821156673. The cubic root of 5250432 is about 173.8060992358.
Adding to 5250432 its reverse (2340525), we get a palindrome (7590957).
The spelling of 5250432 in words is "five million, two hundred fifty thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •