Search a number
-
+
11055593293 = 108710170739
BaseRepresentation
bin10100100101111011…
…01111011101001101
31001112111001022220021
422102331233131031
5140120212441133
65025011422141
7540652664263
oct122275573515
931474038807
1011055593293
114763659968
1221865b4951
1310725c08a4
1476c422433
1544a8c152d
hex292f6f74d

11055593293 has 4 divisors (see below), whose sum is σ = 11065765120. Its totient is φ = 11045421468.

The previous prime is 11055593291. The next prime is 11055593321. The reversal of 11055593293 is 39239555011.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 39239555011 = 63436186277.

It is a cyclic number.

It is not a de Polignac number, because 11055593293 - 21 = 11055593291 is a prime.

It is a super-2 number, since 2×110555932932 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11055593291) 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, 5084283 + ... + 5086456.

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

Almost surely, 211055593293 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 10171826.

The product of its (nonzero) digits is 182250, while the sum is 43.

The spelling of 11055593293 in words is "eleven billion, fifty-five million, five hundred ninety-three thousand, two hundred ninety-three".

Divisors: 1 1087 10170739 11055593293