Base | Representation |
---|---|
bin | 1010000111110110111011… |
… | …0111001101110010110101 |
3 | 1110102000210012211100101121 |
4 | 2201331232313031302311 |
5 | 2424323441234411432 |
6 | 35401035011423541 |
7 | 2226060516666535 |
oct | 241755667156265 |
9 | 43360705740347 |
10 | 11130120232117 |
11 | 3601291789227 |
12 | 12b91128b4bb1 |
13 | 6297481a4343 |
14 | 2a69b49bb4c5 |
15 | 1447bed6c197 |
hex | a1f6edcdcb5 |
11130120232117 has 2 divisors, whose sum is σ = 11130120232118. Its totient is φ = 11130120232116.
The previous prime is 11130120232097. The next prime is 11130120232141. The reversal of 11130120232117 is 71123202103111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9651174809956 + 1478945422161 = 3106634^2 + 1216119^2 .
It is a cyclic number.
It is not a de Polignac number, because 11130120232117 - 235 = 11095760493749 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11130120232091 and 11130120232100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11130120236117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5565060116058 + 5565060116059.
It is an arithmetic number, because the mean of its divisors is an integer number (5565060116059).
Almost surely, 211130120232117 is an apocalyptic number.
It is an amenable number.
11130120232117 is a deficient number, since it is larger than the sum of its proper divisors (1).
11130120232117 is an equidigital number, since it uses as much as digits as its factorization.
11130120232117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 25.
Adding to 11130120232117 its reverse (71123202103111), we get a palindrome (82253322335228).
The spelling of 11130120232117 in words is "eleven trillion, one hundred thirty billion, one hundred twenty million, two hundred thirty-two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •