Base | Representation |
---|---|
bin | 11110110000001011111… |
… | …100011110111000010011 |
3 | 21111000212012112111000202 |
4 | 132300023330132320103 |
5 | 234111042011023011 |
6 | 4254503042205415 |
7 | 305453101165322 |
oct | 36601374367023 |
9 | 7430765474022 |
10 | 2113324314131 |
11 | 74528a532348 |
12 | 2a16b005386b |
13 | 1243936a7554 |
14 | 743dd37c0b9 |
15 | 39e8bd7c23b |
hex | 1ec0bf1ee13 |
2113324314131 has 2 divisors, whose sum is σ = 2113324314132. Its totient is φ = 2113324314130.
The previous prime is 2113324314071. The next prime is 2113324314169. The reversal of 2113324314131 is 1314134233112.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2113324314131 is a prime.
It is a super-2 number, since 2×21133243141312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2113324314094 and 2113324314103.
It is not a weakly prime, because it can be changed into another prime (2113024314131) 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, 1056662157065 + 1056662157066.
It is an arithmetic number, because the mean of its divisors is an integer number (1056662157066).
Almost surely, 22113324314131 is an apocalyptic number.
2113324314131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2113324314131 is an equidigital number, since it uses as much as digits as its factorization.
2113324314131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5184, while the sum is 29.
Adding to 2113324314131 its reverse (1314134233112), we get a palindrome (3427458547243).
The spelling of 2113324314131 in words is "two trillion, one hundred thirteen billion, three hundred twenty-four million, three hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •