Search a number
-
+
4950935 = 51190017
BaseRepresentation
bin10010111000101110010111
3100022112101222
4102320232113
52231412220
6254040555
760040133
oct22705627
910275358
104950935
112881790
1217a915b
131044662
1492c3c3
1567be25
hex4b8b97

4950935 has 8 divisors (see below), whose sum is σ = 6481296. Its totient is φ = 3600640.

The previous prime is 4950931. The next prime is 4950937. The reversal of 4950935 is 5390594.

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

It is not a de Polignac number, because 4950935 - 22 = 4950931 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 4950895 and 4950904.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (4950931) by changing a digit.

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 7 ways as a sum of consecutive naturals, for example, 44954 + ... + 45063.

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

Almost surely, 24950935 is an apocalyptic number.

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

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

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

The sum of its prime factors is 90033.

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

The square root of 4950935 is about 2225.0696618308. The cubic root of 4950935 is about 170.4364219169.

It can be divided in two parts, 4950 and 935, that added together give a palindrome (5885).

The spelling of 4950935 in words is "four million, nine hundred fifty thousand, nine hundred thirty-five".

Divisors: 1 5 11 55 90017 450085 990187 4950935