Base | Representation |
---|---|
bin | 10100110000100001… |
… | …00001000110110011 |
3 | 1001202200011020121212 |
4 | 22120100201012303 |
5 | 140310431320311 |
6 | 5041503110335 |
7 | 543111563660 |
oct | 123020410663 |
9 | 31680136555 |
10 | 11144401331 |
11 | 47a97a6738 |
12 | 21b02a23ab |
13 | 1087b1611b |
14 | 77a13ca67 |
15 | 4535b4c8b |
hex | 2984211b3 |
11144401331 has 4 divisors (see below), whose sum is σ = 12736458672. Its totient is φ = 9552343992.
The previous prime is 11144401321. The next prime is 11144401349. The reversal of 11144401331 is 13310444111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11144401331 - 26 = 11144401267 is a prime.
It is a super-2 number, since 2×111444013312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11144401297 and 11144401306.
It is not an unprimeable number, because it can be changed into a prime (11144401321) 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 3 ways as a sum of consecutive naturals, for example, 796028660 + ... + 796028673.
It is an arithmetic number, because the mean of its divisors is an integer number (3184114668).
Almost surely, 211144401331 is an apocalyptic number.
11144401331 is a deficient number, since it is larger than the sum of its proper divisors (1592057341).
11144401331 is an equidigital number, since it uses as much as digits as its factorization.
11144401331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1592057340.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 11144401331 its reverse (13310444111), we get a palindrome (24454845442).
The spelling of 11144401331 in words is "eleven billion, one hundred forty-four million, four hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •