Base | Representation |
---|---|
bin | 1010000010110011100111… |
… | …0010011010000001111111 |
3 | 1110002201202200111202012212 |
4 | 2200230321302122001333 |
5 | 2421413220042330101 |
6 | 35253122545051035 |
7 | 2216566010610632 |
oct | 240547162320177 |
9 | 43081680452185 |
10 | 11043330433151 |
11 | 35784a5148745 |
12 | 12a4331026a7b |
13 | 6214c6482b03 |
14 | 2a27001a1c19 |
15 | 1423e07561bb |
hex | a0b39c9a07f |
11043330433151 has 2 divisors, whose sum is σ = 11043330433152. Its totient is φ = 11043330433150.
The previous prime is 11043330433139. The next prime is 11043330433171. The reversal of 11043330433151 is 15133403334011.
11043330433151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (15133403334011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11043330433151 - 238 = 10768452526207 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11043330433111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5521665216575 + 5521665216576.
It is an arithmetic number, because the mean of its divisors is an integer number (5521665216576).
Almost surely, 211043330433151 is an apocalyptic number.
11043330433151 is a deficient number, since it is larger than the sum of its proper divisors (1).
11043330433151 is an equidigital number, since it uses as much as digits as its factorization.
11043330433151 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 19440, while the sum is 32.
Adding to 11043330433151 its reverse (15133403334011), we get a palindrome (26176733767162).
The spelling of 11043330433151 in words is "eleven trillion, forty-three billion, three hundred thirty million, four hundred thirty-three thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •