Base | Representation |
---|---|
bin | 10100101101101111… |
… | …10000101101101001 |
3 | 1001201001101011110012 |
4 | 22112313300231221 |
5 | 140234002300231 |
6 | 5035312301305 |
7 | 542410040324 |
oct | 122667605551 |
9 | 31631334405 |
10 | 11121134441 |
11 | 47976549aa |
12 | 21a4541835 |
13 | 108305aa31 |
14 | 7770037bb |
15 | 45151ae2b |
hex | 296df0b69 |
11121134441 has 4 divisors (see below), whose sum is σ = 11126240400. Its totient is φ = 11116028484.
The previous prime is 11121134417. The next prime is 11121134449. The reversal of 11121134441 is 14443112111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 14443112111 = 97 ⋅148898063.
It is a cyclic number.
It is not a de Polignac number, because 11121134441 - 210 = 11121133417 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11121134449) 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, 2549711 + ... + 2554068.
It is an arithmetic number, because the mean of its divisors is an integer number (2781560100).
Almost surely, 211121134441 is an apocalyptic number.
It is an amenable number.
11121134441 is a deficient number, since it is larger than the sum of its proper divisors (5105959).
11121134441 is an equidigital number, since it uses as much as digits as its factorization.
11121134441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5105958.
The product of its digits is 384, while the sum is 23.
Adding to 11121134441 its reverse (14443112111), we get a palindrome (25564246552).
The spelling of 11121134441 in words is "eleven billion, one hundred twenty-one million, one hundred thirty-four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •