Base | Representation |
---|---|
bin | 1001011000001100101111… |
… | …0001001000110010110001 |
3 | 1100111202101000200102021112 |
4 | 2112003023301020302301 |
5 | 2322420111040310241 |
6 | 33532544141203105 |
7 | 2112653423162225 |
oct | 226031361106261 |
9 | 40452330612245 |
10 | 10311340166321 |
11 | 33160187870a7 |
12 | 11a64a6b60495 |
13 | 59a4805039cc |
14 | 2791003ac785 |
15 | 12d34ce861eb |
hex | 960cbc48cb1 |
10311340166321 has 2 divisors, whose sum is σ = 10311340166322. Its totient is φ = 10311340166320.
The previous prime is 10311340166293. The next prime is 10311340166329. The reversal of 10311340166321 is 12366104311301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8309296282225 + 2002043884096 = 2882585^2 + 1414936^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10311340166321 is a prime.
It is not a weakly prime, because it can be changed into another prime (10311340166329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5155670083160 + 5155670083161.
It is an arithmetic number, because the mean of its divisors is an integer number (5155670083161).
Almost surely, 210311340166321 is an apocalyptic number.
It is an amenable number.
10311340166321 is a deficient number, since it is larger than the sum of its proper divisors (1).
10311340166321 is an equidigital number, since it uses as much as digits as its factorization.
10311340166321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 32.
Adding to 10311340166321 its reverse (12366104311301), we get a palindrome (22677444477622).
The spelling of 10311340166321 in words is "ten trillion, three hundred eleven billion, three hundred forty million, one hundred sixty-six thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •