Base | Representation |
---|---|
bin | 1010000111110111101011… |
… | …0010111000100011111001 |
3 | 1110102001022011112002212201 |
4 | 2201331322302320203321 |
5 | 2424324344012020121 |
6 | 35401110522310201 |
7 | 2226065500411102 |
oct | 241757262704371 |
9 | 43361264462781 |
10 | 11130320423161 |
11 | 3601384791775 |
12 | 12b9169958361 |
13 | 62977a7c7594 |
14 | 2a69d340d3a9 |
15 | 1447d2712e91 |
hex | a1f7acb88f9 |
11130320423161 has 2 divisors, whose sum is σ = 11130320423162. Its totient is φ = 11130320423160.
The previous prime is 11130320423009. The next prime is 11130320423179. The reversal of 11130320423161 is 16132402303111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7259893747561 + 3870426675600 = 2694419^2 + 1967340^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11130320423161 is a prime.
It is not a weakly prime, because it can be changed into another prime (11130320429161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5565160211580 + 5565160211581.
It is an arithmetic number, because the mean of its divisors is an integer number (5565160211581).
Almost surely, 211130320423161 is an apocalyptic number.
It is an amenable number.
11130320423161 is a deficient number, since it is larger than the sum of its proper divisors (1).
11130320423161 is an equidigital number, since it uses as much as digits as its factorization.
11130320423161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 28.
Adding to 11130320423161 its reverse (16132402303111), we get a palindrome (27262722726272).
The spelling of 11130320423161 in words is "eleven trillion, one hundred thirty billion, three hundred twenty million, four hundred twenty-three thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •