Base | Representation |
---|---|
bin | 10100001010101101001100 |
3 | 100221121000220 |
4 | 110022231030 |
5 | 2323133412 |
6 | 305151340 |
7 | 62636133 |
oct | 24125514 |
9 | 10847026 |
10 | 5286732 |
11 | 2a91000 |
12 | 192b550 |
13 | 1131459 |
14 | 9b891a |
15 | 6e668c |
hex | 50ab4c |
5286732 has 48 divisors (see below), whose sum is σ = 13609344. Its totient is φ = 1597200.
The previous prime is 5286727. The next prime is 5286739. The reversal of 5286732 is 2376825.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 5286693 and 5286702.
It is not an unprimeable number, because it can be changed into a prime (5286739) 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, 15807 + ... + 16137.
It is an arithmetic number, because the mean of its divisors is an integer number (283528).
Almost surely, 25286732 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 5286732, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6804672).
5286732 is an abundant number, since it is smaller than the sum of its proper divisors (8322612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5286732 is a wasteful number, since it uses less digits than its factorization.
5286732 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 371 (or 347 counting only the distinct ones).
The product of its digits is 20160, while the sum is 33.
The square root of 5286732 is about 2299.2894554623. The cubic root of 5286732 is about 174.2057283886.
It can be divided in two parts, 528 and 6732, that added together give a triangular number (7260 = T120).
The spelling of 5286732 in words is "five million, two hundred eighty-six thousand, seven hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.197 sec. • engine limits •