Base | Representation |
---|---|
bin | 1010101001000110011100… |
… | …1100111001100101010001 |
3 | 1112102121220022012211211121 |
4 | 2222101213030321211101 |
5 | 3013203100410133022 |
6 | 40515244540042241 |
7 | 2315246124620056 |
oct | 252214714714521 |
9 | 45377808184747 |
10 | 11701222349137 |
11 | 3801507a69602 |
12 | 138b937833381 |
13 | 66b560babbb9 |
14 | 2c64b0d4702d |
15 | 154597c142c7 |
hex | aa467339951 |
11701222349137 has 2 divisors, whose sum is σ = 11701222349138. Its totient is φ = 11701222349136.
The previous prime is 11701222349053. The next prime is 11701222349281. The reversal of 11701222349137 is 73194322210711.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11647483691281 + 53738657856 = 3412841^2 + 231816^2 .
It is a cyclic number.
It is not a de Polignac number, because 11701222349137 - 239 = 11151466535249 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11701222349093 and 11701222349102.
It is not a weakly prime, because it can be changed into another prime (11701222349437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5850611174568 + 5850611174569.
It is an arithmetic number, because the mean of its divisors is an integer number (5850611174569).
Almost surely, 211701222349137 is an apocalyptic number.
It is an amenable number.
11701222349137 is a deficient number, since it is larger than the sum of its proper divisors (1).
11701222349137 is an equidigital number, since it uses as much as digits as its factorization.
11701222349137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 127008, while the sum is 43.
Adding to 11701222349137 its reverse (73194322210711), we get a palindrome (84895544559848).
The spelling of 11701222349137 in words is "eleven trillion, seven hundred one billion, two hundred twenty-two million, three hundred forty-nine thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •