Base | Representation |
---|---|
bin | 10100100100011101… |
… | …10110011101111001 |
3 | 1001111121220211101002 |
4 | 22102032312131321 |
5 | 140104041114431 |
6 | 5023452134345 |
7 | 540443340350 |
oct | 122216663571 |
9 | 31447824332 |
10 | 11043301241 |
11 | 4757723745 |
12 | 21824673b5 |
13 | 106cba899b |
14 | 76a942997 |
15 | 4497943cb |
hex | 2923b6779 |
11043301241 has 4 divisors (see below), whose sum is σ = 12620915712. Its totient is φ = 9465686772.
The previous prime is 11043301207. The next prime is 11043301301. The reversal of 11043301241 is 14210334011.
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: 14210334011 = 8627 ⋅1647193.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11043301241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11043301741) 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, 788807225 + ... + 788807238.
It is an arithmetic number, because the mean of its divisors is an integer number (3155228928).
Almost surely, 211043301241 is an apocalyptic number.
It is an amenable number.
11043301241 is a deficient number, since it is larger than the sum of its proper divisors (1577614471).
11043301241 is an equidigital number, since it uses as much as digits as its factorization.
11043301241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1577614470.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 11043301241 its reverse (14210334011), we get a palindrome (25253635252).
The spelling of 11043301241 in words is "eleven billion, forty-three million, three hundred one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •