Search a number
-
+
11056070 = 251105607
BaseRepresentation
bin101010001011…
…001111000110
3202210201002002
4222023033012
510312243240
61032545302
7162655304
oct52131706
922721062
1011056070
116271653
123852232
1323a146c
14167b274
15e85d15
hexa8b3c6

11056070 has 8 divisors (see below), whose sum is σ = 19900944. Its totient is φ = 4422424.

The previous prime is 11056051. The next prime is 11056079. The reversal of 11056070 is 7065011.

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

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

It is a Curzon number.

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 552794 + ... + 552813.

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

Almost surely, 211056070 is an apocalyptic number.

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

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

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

11056070 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 1105614.

The product of its (nonzero) digits is 210, while the sum is 20.

The square root of 11056070 is about 3325.0669166199. The cubic root of 11056070 is about 222.7752432613.

The spelling of 11056070 in words is "eleven million, fifty-six thousand, seventy".

Divisors: 1 2 5 10 1105607 2211214 5528035 11056070