Base | Representation |
---|---|
bin | 1010010011100000101100… |
… | …1010011100011110101001 |
3 | 1111010011111212002202212021 |
4 | 2210320023022130132221 |
5 | 2441113434104424223 |
6 | 40033023434544441 |
7 | 2246405445400054 |
oct | 244701312343651 |
9 | 44104455082767 |
10 | 11330311014313 |
11 | 3679181206965 |
12 | 132ba82298121 |
13 | 64259cba0c95 |
14 | 2b2566161a9b |
15 | 149ad9e2965d |
hex | a4e0b29c7a9 |
11330311014313 has 2 divisors, whose sum is σ = 11330311014314. Its totient is φ = 11330311014312.
The previous prime is 11330311014257. The next prime is 11330311014329. The reversal of 11330311014313 is 31341011303311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10225138196329 + 1105172817984 = 3197677^2 + 1051272^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11330311014313 is a prime.
It is not a weakly prime, because it can be changed into another prime (11330311014013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665155507156 + 5665155507157.
It is an arithmetic number, because the mean of its divisors is an integer number (5665155507157).
Almost surely, 211330311014313 is an apocalyptic number.
It is an amenable number.
11330311014313 is a deficient number, since it is larger than the sum of its proper divisors (1).
11330311014313 is an equidigital number, since it uses as much as digits as its factorization.
11330311014313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 11330311014313 its reverse (31341011303311), we get a palindrome (42671322317624).
The spelling of 11330311014313 in words is "eleven trillion, three hundred thirty billion, three hundred eleven million, fourteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •