Base | Representation |
---|---|
bin | 1011110101111000011100… |
… | …1001101000011100110001 |
3 | 1201002201201000121021022101 |
4 | 2331132013021220130301 |
5 | 3201311100202321223 |
6 | 43405241021340401 |
7 | 2512454334115342 |
oct | 275360711503461 |
9 | 51081630537271 |
10 | 13020313323313 |
11 | 416a97a4831aa |
12 | 1563510707701 |
13 | 735a6c24725a |
14 | 330287b8c0c9 |
15 | 178a4cb944ad |
hex | bd787268731 |
13020313323313 has 2 divisors, whose sum is σ = 13020313323314. Its totient is φ = 13020313323312.
The previous prime is 13020313323299. The next prime is 13020313323319. The reversal of 13020313323313 is 31332331302031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12702153024064 + 318160299249 = 3564008^2 + 564057^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13020313323313 is a prime.
It is not a weakly prime, because it can be changed into another prime (13020313323319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6510156661656 + 6510156661657.
It is an arithmetic number, because the mean of its divisors is an integer number (6510156661657).
Almost surely, 213020313323313 is an apocalyptic number.
It is an amenable number.
13020313323313 is a deficient number, since it is larger than the sum of its proper divisors (1).
13020313323313 is an equidigital number, since it uses as much as digits as its factorization.
13020313323313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8748, while the sum is 28.
Adding to 13020313323313 its reverse (31332331302031), we get a palindrome (44352644625344).
The spelling of 13020313323313 in words is "thirteen trillion, twenty billion, three hundred thirteen million, three hundred twenty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •