Base | Representation |
---|---|
bin | 1011111011010010000111… |
… | …0010110011010010110001 |
3 | 1201102121012122002112110002 |
4 | 2332310201302303102301 |
5 | 3204321113120320423 |
6 | 43520024223315345 |
7 | 2522250615636662 |
oct | 276644162632261 |
9 | 51377178075402 |
10 | 13113102120113 |
11 | 41a626531a636 |
12 | 15794a744bb55 |
13 | 741738a73348 |
14 | 33496b1d5369 |
15 | 17b17dc96228 |
hex | bed21cb34b1 |
13113102120113 has 2 divisors, whose sum is σ = 13113102120114. Its totient is φ = 13113102120112.
The previous prime is 13113102120109. The next prime is 13113102120121. The reversal of 13113102120113 is 31102120131131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13017786672289 + 95315447824 = 3608017^2 + 308732^2 .
It is a cyclic number.
It is not a de Polignac number, because 13113102120113 - 22 = 13113102120109 is a prime.
It is not a weakly prime, because it can be changed into another prime (13113102120103) 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, 6556551060056 + 6556551060057.
It is an arithmetic number, because the mean of its divisors is an integer number (6556551060057).
Almost surely, 213113102120113 is an apocalyptic number.
It is an amenable number.
13113102120113 is a deficient number, since it is larger than the sum of its proper divisors (1).
13113102120113 is an equidigital number, since it uses as much as digits as its factorization.
13113102120113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 13113102120113 its reverse (31102120131131), we get a palindrome (44215222251244).
The spelling of 13113102120113 in words is "thirteen trillion, one hundred thirteen billion, one hundred two million, one hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •