Base | Representation |
---|---|
bin | 1010100010110011001101 |
3 | 12012102110200 |
4 | 22202303031 |
5 | 1201421411 |
6 | 135124113 |
7 | 32331153 |
oct | 12426315 |
9 | 5172420 |
10 | 2763981 |
11 | 1618690 |
12 | b13639 |
13 | 75a0bc |
14 | 51d3d3 |
15 | 398e56 |
hex | 2a2ccd |
2763981 has 12 divisors (see below), whose sum is σ = 4355520. Its totient is φ = 1675080.
The previous prime is 2763977. The next prime is 2763989. The reversal of 2763981 is 1893672.
2763981 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2763981 - 22 = 2763977 is a prime.
It is a super-2 number, since 2×27639812 = 15279181936722, which contains 22 as substring.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
2763981 is a lucky number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2763989) 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 11 ways as a sum of consecutive naturals, for example, 13861 + ... + 14058.
It is an arithmetic number, because the mean of its divisors is an integer number (362960).
22763981 is an apocalyptic number.
It is an amenable number.
2763981 is a deficient number, since it is larger than the sum of its proper divisors (1591539).
2763981 is a wasteful number, since it uses less digits than its factorization.
2763981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27936 (or 27933 counting only the distinct ones).
The product of its digits is 18144, while the sum is 36.
The square root of 2763981 is about 1662.5224810510. The cubic root of 2763981 is about 140.3389914398.
The spelling of 2763981 in words is "two million, seven hundred sixty-three thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •