Search a number
-
+
55076750 = 253220307
BaseRepresentation
bin1101001000011…
…0011110001110
310211122012002122
43102012132032
5103044424000
65244252542
71236100421
oct322063616
9124565078
1055076750
11290a8a83
1216541152
13b5450c1
1474599b8
154c7e085
hex348678e

55076750 has 16 divisors (see below), whose sum is σ = 103104144. Its totient is φ = 22030600.

The previous prime is 55076701. The next prime is 55076779. The reversal of 55076750 is 5767055.

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

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 55076750.

It is a congruent number.

It is an unprimeable number.

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, 109904 + ... + 110403.

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

Almost surely, 255076750 is an apocalyptic number.

55076750 is a gapful number since it is divisible by the number (50) formed by its first and last digit.

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

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

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

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

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

The square root of 55076750 is about 7421.3711671092. The cubic root of 55076750 is about 380.4720587669.

The spelling of 55076750 in words is "fifty-five million, seventy-six thousand, seven hundred fifty".

Divisors: 1 2 5 10 25 50 125 250 220307 440614 1101535 2203070 5507675 11015350 27538375 55076750