Base | Representation |
---|---|
bin | 1010010011100011011000… |
… | …1000111001111110111001 |
3 | 1111010020101002211020000222 |
4 | 2210320312020321332321 |
5 | 2441121423144444121 |
6 | 40033223152505425 |
7 | 2246432352054023 |
oct | 244706610717671 |
9 | 44106332736028 |
10 | 11331032031161 |
11 | 3679511200557 |
12 | 133004384b275 |
13 | 64268638b57b |
14 | 2b25d3c0b013 |
15 | 149b2d39e0ab |
hex | a4e36239fb9 |
11331032031161 has 2 divisors, whose sum is σ = 11331032031162. Its totient is φ = 11331032031160.
The previous prime is 11331032030987. The next prime is 11331032031173. The reversal of 11331032031161 is 16113023013311.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11159234215936 + 171797815225 = 3340544^2 + 414485^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11331032031161 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11331032031161.
It is not a weakly prime, because it can be changed into another prime (11331832031161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665516015580 + 5665516015581.
It is an arithmetic number, because the mean of its divisors is an integer number (5665516015581).
Almost surely, 211331032031161 is an apocalyptic number.
It is an amenable number.
11331032031161 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331032031161 is an equidigital number, since it uses as much as digits as its factorization.
11331032031161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 26.
Adding to 11331032031161 its reverse (16113023013311), we get a palindrome (27444055044472).
The spelling of 11331032031161 in words is "eleven trillion, three hundred thirty-one billion, thirty-two million, thirty-one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •