Base | Representation |
---|---|
bin | 10100000010110111000000 |
3 | 100212221221112 |
4 | 110002313000 |
5 | 2321121332 |
6 | 304342452 |
7 | 62443340 |
oct | 24026700 |
9 | 10787845 |
10 | 5254592 |
11 | 2a69942 |
12 | 1914a28 |
13 | 111c935 |
14 | 9aad20 |
15 | 6dbdb2 |
hex | 502dc0 |
5254592 has 56 divisors (see below), whose sum is σ = 12277344. Its totient is φ = 2184192.
The previous prime is 5254591. The next prime is 5254607. The reversal of 5254592 is 2954525.
It is a tau number, because it is divible by the number of its divisors (56).
It is a super-2 number, since 2×52545922 = 55221474172928, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a d-powerful number, because it can be written as 53 + 25 + 53 + 49 + 57 + 97 + 217 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5254591) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16418 + ... + 16734.
Almost surely, 25254592 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 5254592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6138672).
5254592 is an abundant number, since it is smaller than the sum of its proper divisors (7022752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5254592 is a wasteful number, since it uses less digits than its factorization.
5254592 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 373 (or 363 counting only the distinct ones).
The product of its digits is 18000, while the sum is 32.
The square root of 5254592 is about 2292.2896850093. The cubic root of 5254592 is about 173.8519902216.
The spelling of 5254592 in words is "five million, two hundred fifty-four thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •