Base | Representation |
---|---|
bin | 11110110000001011001… |
… | …010000101100000110111 |
3 | 21111000211021200021210202 |
4 | 132300023022011200313 |
5 | 234111030120244111 |
6 | 4254501451111115 |
7 | 305452550663102 |
oct | 36601312054067 |
9 | 7430737607722 |
10 | 2113311103031 |
11 | 745283029687 |
12 | 2a16a774249b |
13 | 124390a3022b |
14 | 743db6dd739 |
15 | 39e8ab1cb3b |
hex | 1ec0b285837 |
2113311103031 has 2 divisors, whose sum is σ = 2113311103032. Its totient is φ = 2113311103030.
The previous prime is 2113311103003. The next prime is 2113311103129. The reversal of 2113311103031 is 1303011133112.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2113311103031 - 214 = 2113311086647 is a prime.
It is a super-2 number, since 2×21133111030312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2113311102994 and 2113311103012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2113311108031) 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, 1056655551515 + 1056655551516.
It is an arithmetic number, because the mean of its divisors is an integer number (1056655551516).
Almost surely, 22113311103031 is an apocalyptic number.
2113311103031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2113311103031 is an equidigital number, since it uses as much as digits as its factorization.
2113311103031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 2113311103031 its reverse (1303011133112), we get a palindrome (3416322236143).
The spelling of 2113311103031 in words is "two trillion, one hundred thirteen billion, three hundred eleven million, one hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •