Base | Representation |
---|---|
bin | 1010010011100011101001… |
… | …0001001100000101000001 |
3 | 1111010020112221012000111221 |
4 | 2210320322101030011001 |
5 | 2441122043413430142 |
6 | 40033234105435041 |
7 | 2246434152661645 |
oct | 244707221140501 |
9 | 44106487160457 |
10 | 11331101311297 |
11 | 367954731a769 |
12 | 1330062a9ba81 |
13 | 642697837531 |
14 | 2b25dd0c2c25 |
15 | 149b344d6767 |
hex | a4e3a44c141 |
11331101311297 has 2 divisors, whose sum is σ = 11331101311298. Its totient is φ = 11331101311296.
The previous prime is 11331101311279. The next prime is 11331101311303. The reversal of 11331101311297 is 79211310113311.
Together with previous prime (11331101311279) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10605906002241 + 725195309056 = 3256671^2 + 851584^2 .
It is a cyclic number.
It is not a de Polignac number, because 11331101311297 - 227 = 11330967093569 is a prime.
It is not a weakly prime, because it can be changed into another prime (11331101311207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665550655648 + 5665550655649.
It is an arithmetic number, because the mean of its divisors is an integer number (5665550655649).
Almost surely, 211331101311297 is an apocalyptic number.
It is an amenable number.
11331101311297 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331101311297 is an equidigital number, since it uses as much as digits as its factorization.
11331101311297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3402, while the sum is 34.
The spelling of 11331101311297 in words is "eleven trillion, three hundred thirty-one billion, one hundred one million, three hundred eleven thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •