Search a number
-
+
2748950 = 25254979
BaseRepresentation
bin1010011111001000010110
312011122211222
422133020112
51200431300
6134530342
732236301
oct12371026
95148758
102748950
111608366
12b069b2
137532c9
14517b38
15394785
hex29f216

2748950 has 12 divisors (see below), whose sum is σ = 5113140. Its totient is φ = 1099560.

The previous prime is 2748931. The next prime is 2748953. The reversal of 2748950 is 598472.

It is a happy number.

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

It is a super-2 number, since 2×27489502 = 15113452205000, which contains 22 as substring.

It is an Ulam number.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 2748950.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (2748953) 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 5 ways as a sum of consecutive naturals, for example, 27440 + ... + 27539.

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

22748950 is an apocalyptic number.

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

2748950 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 54991 (or 54986 counting only the distinct ones).

The product of its (nonzero) digits is 20160, while the sum is 35.

The square root of 2748950 is about 1657.9957780405. The cubic root of 2748950 is about 140.0841331035.

The spelling of 2748950 in words is "two million, seven hundred forty-eight thousand, nine hundred fifty".

Divisors: 1 2 5 10 25 50 54979 109958 274895 549790 1374475 2748950