Base | Representation |
---|---|
bin | 10100011111110100… |
… | …00100111101001011 |
3 | 1001101220112102021120 |
4 | 22033322010331023 |
5 | 140014100114011 |
6 | 5015540210323 |
7 | 536461005405 |
oct | 121772047513 |
9 | 31356472246 |
10 | 11004301131 |
11 | 473770634a |
12 | 21713999a3 |
13 | 1064aa22b5 |
14 | 7656adb75 |
15 | 44613da06 |
hex | 28fe84f4b |
11004301131 has 4 divisors (see below), whose sum is σ = 14672401512. Its totient is φ = 7336200752.
The previous prime is 11004301109. The next prime is 11004301141. The reversal of 11004301131 is 13110340011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11004301131 is a prime.
It is a super-2 number, since 2×110043011312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11004301131.
It is not an unprimeable number, because it can be changed into a prime (11004301141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1834050186 + ... + 1834050191.
It is an arithmetic number, because the mean of its divisors is an integer number (3668100378).
Almost surely, 211004301131 is an apocalyptic number.
11004301131 is a deficient number, since it is larger than the sum of its proper divisors (3668100381).
11004301131 is an equidigital number, since it uses as much as digits as its factorization.
11004301131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3668100380.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 11004301131 its reverse (13110340011), we get a palindrome (24114641142).
The spelling of 11004301131 in words is "eleven billion, four million, three hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •