Search a number
-
+
2748965 = 5619013
BaseRepresentation
bin1010011111001000100101
312011122212112
422133020211
51200431330
6134530405
732236322
oct12371045
95148775
102748965
11160837a
12b06a05
1375330b
14517b49
15394795
hex29f225

2748965 has 8 divisors (see below), whose sum is σ = 3353208. Its totient is φ = 2162880.

The previous prime is 2748953. The next prime is 2748971. The reversal of 2748965 is 5698472.

2748965 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a Cunningham number, because it is equal to 16582+1.

It can be written as a sum of positive squares in 4 ways, for example, as 1 + 2748964 = 1^2 + 1658^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 2748965 - 214 = 2732581 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

It is an unprimeable number.

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, 4202 + ... + 4811.

It is an arithmetic number, because the mean of its divisors is an integer number (419151).

22748965 is an apocalyptic number.

It is an amenable number.

2748965 is a deficient number, since it is larger than the sum of its proper divisors (604243).

2748965 is an equidigital number, since it uses as much as digits as its factorization.

2748965 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 9079.

The product of its digits is 120960, while the sum is 41.

The square root of 2748965 is about 1658.0003015681. Note that the first 3 decimals coincide. The cubic root of 2748965 is about 140.0843878987.

The spelling of 2748965 in words is "two million, seven hundred forty-eight thousand, nine hundred sixty-five".

Divisors: 1 5 61 305 9013 45065 549793 2748965