Search a number
-
+
11230990111 = 111278039363
BaseRepresentation
bin10100111010110101…
…10100111100011111
31001222201002102002201
422131122310330133
5141000113140421
65054235032331
7545212561255
oct123532647437
931881072081
1011230990111
114843668110
12221529b6a7
13109ca424a3
1478783c5d5
1545aebab91
hex29d6b4f1f

11230990111 has 8 divisors (see below), whose sum is σ = 12348463104. Its totient is φ = 10129596120.

The previous prime is 11230990097. The next prime is 11230990129. The reversal of 11230990111 is 11109903211.

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 11230990111 - 227 = 11096772383 is a prime.

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

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 11230990111.

It is a congruent number.

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

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

Almost surely, 211230990111 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 8039501.

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

The spelling of 11230990111 in words is "eleven billion, two hundred thirty million, nine hundred ninety thousand, one hundred eleven".

Divisors: 1 11 127 1397 8039363 88432993 1020999101 11230990111