Base | Representation |
---|---|
bin | 1011111100011100001111… |
… | …1011100101101111110101 |
3 | 1201111111120111121102221201 |
4 | 2333013003323211233311 |
5 | 3210132342030431401 |
6 | 43533115023212501 |
7 | 2523554015562505 |
oct | 277070373455765 |
9 | 51444514542851 |
10 | 13133002202101 |
11 | 4203747403791 |
12 | 158131ba47131 |
13 | 74358a8358a2 |
14 | 3358d810ba05 |
15 | 17b945d76b01 |
hex | bf1c3ee5bf5 |
13133002202101 has 2 divisors, whose sum is σ = 13133002202102. Its totient is φ = 13133002202100.
The previous prime is 13133002202081. The next prime is 13133002202119. The reversal of 13133002202101 is 10120220033131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8343027864900 + 4789974337201 = 2888430^2 + 2188601^2 .
It is a cyclic number.
It is not a de Polignac number, because 13133002202101 - 27 = 13133002201973 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13133005202101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6566501101050 + 6566501101051.
It is an arithmetic number, because the mean of its divisors is an integer number (6566501101051).
Almost surely, 213133002202101 is an apocalyptic number.
It is an amenable number.
13133002202101 is a deficient number, since it is larger than the sum of its proper divisors (1).
13133002202101 is an equidigital number, since it uses as much as digits as its factorization.
13133002202101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 13133002202101 its reverse (10120220033131), we get a palindrome (23253222235232).
The spelling of 13133002202101 in words is "thirteen trillion, one hundred thirty-three billion, two million, two hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •