Base | Representation |
---|---|
bin | 1100000110110000110001… |
… | …1111000110110101000101 |
3 | 1202010110020121101220120202 |
4 | 3001230030133012311011 |
5 | 3221034010130200313 |
6 | 44150401243540245 |
7 | 2542431652606241 |
oct | 301541437066505 |
9 | 52113217356522 |
10 | 13310313131333 |
11 | 4271965844229 |
12 | 15ab764b2a685 |
13 | 75720731c1aa |
14 | 340318b1b421 |
15 | 181372458558 |
hex | c1b0c7c6d45 |
13310313131333 has 2 divisors, whose sum is σ = 13310313131334. Its totient is φ = 13310313131332.
The previous prime is 13310313131293. The next prime is 13310313131359. The reversal of 13310313131333 is 33313131301331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6709514214529 + 6600798916804 = 2590273^2 + 2569202^2 .
It is a cyclic number.
It is not a de Polignac number, because 13310313131333 - 220 = 13310312082757 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13310313131296 and 13310313131305.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13310313121333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6655156565666 + 6655156565667.
It is an arithmetic number, because the mean of its divisors is an integer number (6655156565667).
Almost surely, 213310313131333 is an apocalyptic number.
It is an amenable number.
13310313131333 is a deficient number, since it is larger than the sum of its proper divisors (1).
13310313131333 is an equidigital number, since it uses as much as digits as its factorization.
13310313131333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6561, while the sum is 29.
Adding to 13310313131333 its reverse (33313131301331), we get a palindrome (46623444432664).
The spelling of 13310313131333 in words is "thirteen trillion, three hundred ten billion, three hundred thirteen million, one hundred thirty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •