Base | Representation |
---|---|
bin | 1100001001010111101110… |
… | …0100110001110100110101 |
3 | 1202021201220201210001202212 |
4 | 3002111323210301310311 |
5 | 3222302244344441401 |
6 | 44223132131143205 |
7 | 2545606325516012 |
oct | 302257344616465 |
9 | 52251821701685 |
10 | 13355126562101 |
11 | 4289971860025 |
12 | 15b8390a44b05 |
13 | 75b4c969932c |
14 | 34256a6a2709 |
15 | 1825e67e1dbb |
hex | c257b931d35 |
13355126562101 has 2 divisors, whose sum is σ = 13355126562102. Its totient is φ = 13355126562100.
The previous prime is 13355126562073. The next prime is 13355126562103. The reversal of 13355126562101 is 10126562155331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13036324042225 + 318802519876 = 3610585^2 + 564626^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13355126562101 is a prime.
Together with 13355126562103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13355126562103) 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, 6677563281050 + 6677563281051.
It is an arithmetic number, because the mean of its divisors is an integer number (6677563281051).
Almost surely, 213355126562101 is an apocalyptic number.
It is an amenable number.
13355126562101 is a deficient number, since it is larger than the sum of its proper divisors (1).
13355126562101 is an equidigital number, since it uses as much as digits as its factorization.
13355126562101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162000, while the sum is 41.
The spelling of 13355126562101 in words is "thirteen trillion, three hundred fifty-five billion, one hundred twenty-six million, five hundred sixty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •