Base | Representation |
---|---|
bin | 10100110000000001… |
… | …00111001001000111 |
3 | 1001202101022102000222 |
4 | 22120000213021013 |
5 | 140303344404001 |
6 | 5041233454555 |
7 | 543031256525 |
oct | 123000471107 |
9 | 31671272028 |
10 | 11140231751 |
11 | 47a7409000 |
12 | 21aaa1145b |
13 | 1086cb630c |
14 | 779775315 |
15 | 45303e61b |
hex | 298027247 |
11140231751 has 16 divisors (see below), whose sum is σ = 12538445568. Its totient is φ = 9891909720.
The previous prime is 11140231721. The next prime is 11140231759. The reversal of 11140231751 is 15713204111.
It is not a de Polignac number, because 11140231751 - 222 = 11136037447 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11140231751.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11140231759) 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 15 ways as a sum of consecutive naturals, for example, 40091 + ... + 154556.
It is an arithmetic number, because the mean of its divisors is an integer number (783652848).
Almost surely, 211140231751 is an apocalyptic number.
11140231751 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11140231751 is a deficient number, since it is larger than the sum of its proper divisors (1398213817).
11140231751 is an equidigital number, since it uses as much as digits as its factorization.
11140231751 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194723 (or 194701 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 26.
Adding to 11140231751 its reverse (15713204111), we get a palindrome (26853435862).
The spelling of 11140231751 in words is "eleven billion, one hundred forty million, two hundred thirty-one thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •