Base | Representation |
---|---|
bin | 10100010000110110000000 |
3 | 100222212112000 |
4 | 110100312000 |
5 | 2324434442 |
6 | 305504000 |
7 | 63102336 |
oct | 24206600 |
9 | 10885460 |
10 | 5311872 |
11 | 2aa8985 |
12 | 1942000 |
13 | 113ca27 |
14 | 9c3b56 |
15 | 6edd4c |
hex | 510d80 |
5311872 has 128 divisors (see below), whose sum is σ = 16524000. Its totient is φ = 1677312.
The previous prime is 5311847. The next prime is 5311877. The reversal of 5311872 is 2781135.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (27).
Its product of digits (1680) is a multiple of the sum of its prime factors (105).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5311877) 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 15 ways as a sum of consecutive naturals, for example, 100198 + ... + 100250.
Almost surely, 25311872 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 5311872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8262000).
5311872 is an abundant number, since it is smaller than the sum of its proper divisors (11212128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5311872 is a wasteful number, since it uses less digits than its factorization.
5311872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105 (or 87 counting only the distinct ones).
The product of its digits is 1680, while the sum is 27.
The square root of 5311872 is about 2304.7498779694. The cubic root of 5311872 is about 174.4814253784.
The spelling of 5311872 in words is "five million, three hundred eleven thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •