Base | Representation |
---|---|
bin | 1100000000010110111111… |
… | …1110011010000000000101 |
3 | 1201201221022111222220202211 |
4 | 3000011233332122000011 |
5 | 3212233220130143023 |
6 | 44024050134103421 |
7 | 2531456031204661 |
oct | 300055776320005 |
9 | 51657274886684 |
10 | 13200313131013 |
11 | 422a2486a3958 |
12 | 15923861aab71 |
13 | 749a26b220c8 |
14 | 338c819378a1 |
15 | 17d585360a0d |
hex | c016ff9a005 |
13200313131013 has 2 divisors, whose sum is σ = 13200313131014. Its totient is φ = 13200313131012.
The previous prime is 13200313131007. The next prime is 13200313131043. The reversal of 13200313131013 is 31013131300231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13200265769089 + 47361924 = 3633217^2 + 6882^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13200313131013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13200313131043) 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, 6600156565506 + 6600156565507.
It is an arithmetic number, because the mean of its divisors is an integer number (6600156565507).
Almost surely, 213200313131013 is an apocalyptic number.
It is an amenable number.
13200313131013 is a deficient number, since it is larger than the sum of its proper divisors (1).
13200313131013 is an equidigital number, since it uses as much as digits as its factorization.
13200313131013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 13200313131013 its reverse (31013131300231), we get a palindrome (44213444431244).
The spelling of 13200313131013 in words is "thirteen trillion, two hundred billion, three hundred thirteen million, one hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •