Base | Representation |
---|---|
bin | 1001101110111001100000 |
3 | 11210121212000 |
4 | 21232321200 |
5 | 1123121032 |
6 | 130404000 |
7 | 30454314 |
oct | 11567140 |
9 | 4717760 |
10 | 2551392 |
11 | 1492998 |
12 | a30600 |
13 | 6b43cc |
14 | 4a5b44 |
15 | 355e7c |
hex | 26ee60 |
2551392 has 48 divisors (see below), whose sum is σ = 7444080. Its totient is φ = 850176.
The previous prime is 2551369. The next prime is 2551397. The reversal of 2551392 is 2931552.
2551392 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×25513922 = 13019202275328, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2551397) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 613 + ... + 2340.
It is an arithmetic number, because the mean of its divisors is an integer number (155085).
22551392 is an apocalyptic number.
It is an amenable number.
2551392 is an abundant number, since it is smaller than the sum of its proper divisors (4892688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2551392 is a wasteful number, since it uses less digits than its factorization.
2551392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2972 (or 2958 counting only the distinct ones).
The product of its digits is 2700, while the sum is 27.
The square root of 2551392 is about 1597.3077349090. The cubic root of 2551392 is about 136.6445757142.
The spelling of 2551392 in words is "two million, five hundred fifty-one thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •