Base | Representation |
---|---|
bin | 11110110000010000100… |
… | …001001011010110011011 |
3 | 21111001001112220200022221 |
4 | 132300100201023112123 |
5 | 234111221131323311 |
6 | 4254514422524511 |
7 | 305455022313565 |
oct | 36602041132633 |
9 | 7431045820287 |
10 | 2113401042331 |
11 | 745319879387 |
12 | 2a1711896737 |
13 | 1243a6560657 |
14 | 74409632335 |
15 | 39e93986671 |
hex | 1ec1084b59b |
2113401042331 has 2 divisors, whose sum is σ = 2113401042332. Its totient is φ = 2113401042330.
The previous prime is 2113401042323. The next prime is 2113401042359. The reversal of 2113401042331 is 1332401043112.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2113401042331 - 23 = 2113401042323 is a prime.
It is a super-2 number, since 2×21134010423312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2113401042296 and 2113401042305.
It is not a weakly prime, because it can be changed into another prime (2113401042631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1056700521165 + 1056700521166.
It is an arithmetic number, because the mean of its divisors is an integer number (1056700521166).
Almost surely, 22113401042331 is an apocalyptic number.
2113401042331 is a deficient number, since it is larger than the sum of its proper divisors (1).
2113401042331 is an equidigital number, since it uses as much as digits as its factorization.
2113401042331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 2113401042331 its reverse (1332401043112), we get a palindrome (3445802085443).
The spelling of 2113401042331 in words is "two trillion, one hundred thirteen billion, four hundred one million, forty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •