Base | Representation |
---|---|
bin | 1100000110110111110011… |
… | …1101010101000011110101 |
3 | 1202010122010010001221220011 |
4 | 3001231330331111003311 |
5 | 3221101341211232013 |
6 | 44151312412140221 |
7 | 2542526504601652 |
oct | 301557475250365 |
9 | 52118103057804 |
10 | 13312200102133 |
11 | 4272743a00329 |
12 | 15abbb0a67671 |
13 | 75744824046a |
14 | 340457592c29 |
15 | 181432e40c3d |
hex | c1b7cf550f5 |
13312200102133 has 2 divisors, whose sum is σ = 13312200102134. Its totient is φ = 13312200102132.
The previous prime is 13312200102109. The next prime is 13312200102191. The reversal of 13312200102133 is 33120100221331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13271572862289 + 40627239844 = 3643017^2 + 201562^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13312200102133 is a prime.
It is a super-2 number, since 2×133122001021332 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13312200102833) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6656100051066 + 6656100051067.
It is an arithmetic number, because the mean of its divisors is an integer number (6656100051067).
Almost surely, 213312200102133 is an apocalyptic number.
It is an amenable number.
13312200102133 is a deficient number, since it is larger than the sum of its proper divisors (1).
13312200102133 is an equidigital number, since it uses as much as digits as its factorization.
13312200102133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13312200102133 its reverse (33120100221331), we get a palindrome (46432300323464).
The spelling of 13312200102133 in words is "thirteen trillion, three hundred twelve billion, two hundred million, one hundred two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •