Base | Representation |
---|---|
bin | 10100000100001100000000 |
3 | 100220020102000 |
4 | 110010030000 |
5 | 2321310112 |
6 | 304424000 |
7 | 62465241 |
oct | 24041400 |
9 | 10806360 |
10 | 5260032 |
11 | 2a72a38 |
12 | 1918000 |
13 | 112225b |
14 | 9accc8 |
15 | 6dd7dc |
hex | 504300 |
5260032 has 72 divisors (see below), whose sum is σ = 15575280. Its totient is φ = 1751040.
The previous prime is 5260009. The next prime is 5260051. The reversal of 5260032 is 2300625.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a plaindrome in base 13.
It is a junction number, because it is equal to n+sod(n) for n = 5259987 and 5260014.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6532 + ... + 7292.
Almost surely, 25260032 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 5260032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7787640).
5260032 is an abundant number, since it is smaller than the sum of its proper divisors (10315248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5260032 is an equidigital number, since it uses as much as digits as its factorization.
5260032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 786 (or 766 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 18.
The square root of 5260032 is about 2293.4759645569. The cubic root of 5260032 is about 173.9119649788.
Adding to 5260032 its reverse (2300625), we get a palindrome (7560657).
The spelling of 5260032 in words is "five million, two hundred sixty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •