Base | Representation |
---|---|
bin | 1010000010101011011011… |
… | …1101011101001100110101 |
3 | 1110002112002201101022202120 |
4 | 2200222312331131030311 |
5 | 2421344221142430141 |
6 | 35252121100230153 |
7 | 2216460426243645 |
oct | 240526675351465 |
9 | 43075081338676 |
10 | 11041135514421 |
11 | 3577579179821 |
12 | 12a3a19b3b359 |
13 | 62123681022c |
14 | 2a2572888525 |
15 | 142312bdec66 |
hex | a0ab6f5d335 |
11041135514421 has 4 divisors (see below), whose sum is σ = 14721514019232. Its totient is φ = 7360757009612.
The previous prime is 11041135514377. The next prime is 11041135514449. The reversal of 11041135514421 is 12441553114011.
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 11041135514421 - 215 = 11041135481653 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11041135514491) 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, 1840189252401 + ... + 1840189252406.
It is an arithmetic number, because the mean of its divisors is an integer number (3680378504808).
Almost surely, 211041135514421 is an apocalyptic number.
It is an amenable number.
11041135514421 is a deficient number, since it is larger than the sum of its proper divisors (3680378504811).
11041135514421 is an equidigital number, since it uses as much as digits as its factorization.
11041135514421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3680378504810.
The product of its (nonzero) digits is 9600, while the sum is 33.
Adding to 11041135514421 its reverse (12441553114011), we get a palindrome (23482688628432).
The spelling of 11041135514421 in words is "eleven trillion, forty-one billion, one hundred thirty-five million, five hundred fourteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •