Base | Representation |
---|---|
bin | 111110101110110101000 |
3 | 10212102202001 |
4 | 13311312220 |
5 | 1011234332 |
6 | 112020344 |
7 | 23320660 |
oct | 7656650 |
9 | 3772661 |
10 | 2055592 |
11 | 1184440 |
12 | 8316b4 |
13 | 56c836 |
14 | 3b71a0 |
15 | 2a90e7 |
hex | 1f5da8 |
2055592 has 64 divisors (see below), whose sum is σ = 4976640. Its totient is φ = 772800.
The previous prime is 2055569. The next prime is 2055611. The reversal of 2055592 is 2955502.
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 2055592.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28917 + ... + 28987.
It is an arithmetic number, because the mean of its divisors is an integer number (77760).
22055592 is an apocalyptic number.
2055592 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2055592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2488320).
2055592 is an abundant number, since it is smaller than the sum of its proper divisors (2921048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2055592 is a wasteful number, since it uses less digits than its factorization.
2055592 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142 (or 138 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 28.
The square root of 2055592 is about 1433.7335875259. The cubic root of 2055592 is about 127.1488118600.
The spelling of 2055592 in words is "two million, fifty-five thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •