Base | Representation |
---|---|
bin | 10100001000001001001000 |
3 | 100221001122000 |
4 | 110020021020 |
5 | 2322314412 |
6 | 305031000 |
7 | 62563413 |
oct | 24101110 |
9 | 10831560 |
10 | 5276232 |
11 | 2a84125 |
12 | 1925460 |
13 | 1129740 |
14 | 9b4b7a |
15 | 6e34dc |
hex | 508248 |
5276232 has 64 divisors (see below), whose sum is σ = 15792000. Its totient is φ = 1622592.
The previous prime is 5276207. The next prime is 5276233. The reversal of 5276232 is 2326725.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 5276196 and 5276205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5276233) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1869 + ... + 3747.
It is an arithmetic number, because the mean of its divisors is an integer number (246750).
Almost surely, 25276232 is an apocalyptic number.
5276232 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 5276232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7896000).
5276232 is an abundant number, since it is smaller than the sum of its proper divisors (10515768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5276232 is a wasteful number, since it uses less digits than its factorization.
5276232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1907 (or 1897 counting only the distinct ones).
The product of its digits is 5040, while the sum is 27.
The square root of 5276232 is about 2297.0050065248. The cubic root of 5276232 is about 174.0903217156.
The spelling of 5276232 in words is "five million, two hundred seventy-six thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.222 sec. • engine limits •