Search a number
-
+
11011110227 = 134718021457
BaseRepresentation
bin10100100000101000…
…00011010101010011
31001102101100100121022
422100110003111103
5140022321011402
65020342150055
7536602615115
oct122024032523
931371310538
1011011110227
1147405370a7
12217372232b
131066317650
147665633b5
15446a362a2
hex290503553

11011110227 has 8 divisors (see below), whose sum is σ = 12110419776. Its totient is φ = 9947843712.

The previous prime is 11011110221. The next prime is 11011110251. The reversal of 11011110227 is 72201111011.

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 11011110227 - 28 = 11011109971 is a prime.

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

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

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

Almost surely, 211011110227 is an apocalyptic number.

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

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

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

The sum of its prime factors is 18021517.

The product of its (nonzero) digits is 28, while the sum is 17.

Adding to 11011110227 its reverse (72201111011), we get a palindrome (83212221238).

The spelling of 11011110227 in words is "eleven billion, eleven million, one hundred ten thousand, two hundred twenty-seven".

Divisors: 1 13 47 611 18021457 234278941 847008479 11011110227