Base | Representation |
---|---|
bin | 1000001100010101100000 |
3 | 11001010001201 |
4 | 20030111200 |
5 | 1022211210 |
6 | 114010544 |
7 | 24153313 |
oct | 10142540 |
9 | 4033051 |
10 | 2147680 |
11 | 1237647 |
12 | 876a54 |
13 | 5a2722 |
14 | 3dc97a |
15 | 2c653a |
hex | 20c560 |
2147680 has 48 divisors (see below), whose sum is σ = 5249664. Its totient is φ = 829440.
The previous prime is 2147657. The next prime is 2147693. The reversal of 2147680 is 867412.
It is a super-2 number, since 2×21476802 = 9225058764800, which contains 22 as substring.
It is an Ulam number.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 4744 + ... + 5176.
It is an arithmetic number, because the mean of its divisors is an integer number (109368).
22147680 is an apocalyptic number.
2147680 is a gapful number since it is divisible by the number (20) 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 2147680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2624832).
2147680 is an abundant number, since it is smaller than the sum of its proper divisors (3101984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2147680 is a wasteful number, since it uses less digits than its factorization.
2147680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 479 (or 471 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 28.
The square root of 2147680 is about 1465.4965028959. The cubic root of 2147680 is about 129.0198475160.
The spelling of 2147680 in words is "two million, one hundred forty-seven thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •