Search a number
-
+
11311215641 = 112194920059
BaseRepresentation
bin10101000100011001…
…10111010000011001
31002012022001021211122
422202030313100121
5141131132400031
65110222335025
7550205514035
oct124214672031
932168037748
1011311215641
114884982800
12223812a475
1310b355140b
147943631c5
1546306647b
hex2a2337419

11311215641 has 12 divisors (see below), whose sum is σ = 13087359600. Its totient is φ = 9741714840.

The previous prime is 11311215637. The next prime is 11311215653. The reversal of 11311215641 is 14651211311.

It is not a de Polignac number, because 11311215641 - 22 = 11311215637 is a prime.

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2457731 + ... + 2462328.

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

Almost surely, 211311215641 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 4920100 (or 4920089 counting only the distinct ones).

The product of its digits is 720, while the sum is 26.

Adding to 11311215641 its reverse (14651211311), we get a palindrome (25962426952).

The spelling of 11311215641 in words is "eleven billion, three hundred eleven million, two hundred fifteen thousand, six hundred forty-one".

Divisors: 1 11 19 121 209 2299 4920059 54120649 93481121 595327139 1028292331 11311215641