Base | Representation |
---|---|
bin | 10100011110100101000100 |
3 | 101002201200201 |
4 | 110132211010 |
5 | 2333240012 |
6 | 311020244 |
7 | 63425350 |
oct | 24364504 |
9 | 11081621 |
10 | 5368132 |
11 | 3037180 |
12 | 196a684 |
13 | 115c513 |
14 | 9da460 |
15 | 710857 |
hex | 51e944 |
5368132 has 48 divisors (see below), whose sum is σ = 12136320. Its totient is φ = 2016000.
The previous prime is 5368123. The next prime is 5368133. The reversal of 5368132 is 2318635.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 5368132.
It is not an unprimeable number, because it can be changed into a prime (5368133) 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, 8632 + ... + 9232.
It is an arithmetic number, because the mean of its divisors is an integer number (252840).
Almost surely, 25368132 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 5368132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6068160).
5368132 is an abundant number, since it is smaller than the sum of its proper divisors (6768188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5368132 is a wasteful number, since it uses less digits than its factorization.
5368132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 652 (or 650 counting only the distinct ones).
The product of its digits is 4320, while the sum is 28.
The square root of 5368132 is about 2316.9229594443. The cubic root of 5368132 is about 175.0952624196.
It can be divided in two parts, 536 and 8132, that added together give a palindrome (8668).
The spelling of 5368132 in words is "five million, three hundred sixty-eight thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •