Base | Representation |
---|---|
bin | 1010010011100011101110… |
… | …0011111011001101100001 |
3 | 1111010020121102222221001012 |
4 | 2210320323203323031201 |
5 | 2441122114442001121 |
6 | 40033240202350305 |
7 | 2246434535223536 |
oct | 244707343731541 |
9 | 44106542887035 |
10 | 11331123000161 |
11 | 3679558593948 |
12 | 133006a1bb395 |
13 | 64269c18c593 |
14 | 2b2601d2ad8d |
15 | 149b3636cc5b |
hex | a4e3b8fb361 |
11331123000161 has 2 divisors, whose sum is σ = 11331123000162. Its totient is φ = 11331123000160.
The previous prime is 11331123000023. The next prime is 11331123000187. The reversal of 11331123000161 is 16100032113311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8994336891136 + 2336786109025 = 2999056^2 + 1528655^2 .
It is an emirp because it is prime and its reverse (16100032113311) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11331123000161 is a prime.
It is not a weakly prime, because it can be changed into another prime (11331123000661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665561500080 + 5665561500081.
It is an arithmetic number, because the mean of its divisors is an integer number (5665561500081).
Almost surely, 211331123000161 is an apocalyptic number.
It is an amenable number.
11331123000161 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331123000161 is an equidigital number, since it uses as much as digits as its factorization.
11331123000161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 11331123000161 its reverse (16100032113311), we get a palindrome (27431155113472).
The spelling of 11331123000161 in words is "eleven trillion, three hundred thirty-one billion, one hundred twenty-three million, one hundred sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •