Search a number
-
+
11050153213 = 111636162941
BaseRepresentation
bin10100100101010001…
…11111010011111101
31001112002210221111211
422102220333103331
5140112314400323
65024255044421
7540555516061
oct122250772375
931462727454
1011050153213
114760583730
122184810711
1310714376c8
1476b807aa1
1544a19970d
hex292a3f4fd

11050153213 has 8 divisors (see below), whose sum is σ = 12128669856. Its totient is φ = 9983962800.

The previous prime is 11050153207. The next prime is 11050153241. The reversal of 11050153213 is 31235105011.

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

It is a cyclic number.

It is not a de Polignac number, because 11050153213 - 25 = 11050153181 is a prime.

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3079678 + ... + 3083263.

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

Almost surely, 211050153213 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6163115.

The product of its (nonzero) digits is 450, while the sum is 22.

Adding to 11050153213 its reverse (31235105011), we get a palindrome (42285258224).

The spelling of 11050153213 in words is "eleven billion, fifty million, one hundred fifty-three thousand, two hundred thirteen".

Divisors: 1 11 163 1793 6162941 67792351 1004559383 11050153213