Base | Representation |
---|---|
bin | 1010000010110011100111… |
… | …0010011010000001100001 |
3 | 1110002201202200111202011202 |
4 | 2200230321302122001201 |
5 | 2421413220042324441 |
6 | 35253122545050545 |
7 | 2216566010610560 |
oct | 240547162320141 |
9 | 43081680452152 |
10 | 11043330433121 |
11 | 35784a5148718 |
12 | 12a4331026a55 |
13 | 6214c6482aac |
14 | 2a27001a1bd7 |
15 | 1423e075619b |
hex | a0b39c9a061 |
11043330433121 has 4 divisors (see below), whose sum is σ = 12620949066432. Its totient is φ = 9465711799812.
The previous prime is 11043330433111. The next prime is 11043330433123. The reversal of 11043330433121 is 12133403334011.
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.
It is a cyclic number.
It is not a de Polignac number, because 11043330433121 - 234 = 11026150563937 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11043330433123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 788809316645 + ... + 788809316658.
It is an arithmetic number, because the mean of its divisors is an integer number (3155237266608).
Almost surely, 211043330433121 is an apocalyptic number.
It is an amenable number.
11043330433121 is a deficient number, since it is larger than the sum of its proper divisors (1577618633311).
11043330433121 is an equidigital number, since it uses as much as digits as its factorization.
11043330433121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1577618633310.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 11043330433121 its reverse (12133403334011), we get a palindrome (23176733767132).
The spelling of 11043330433121 in words is "eleven trillion, forty-three billion, three hundred thirty million, four hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •