Base | Representation |
---|---|
bin | 11110110000001011001… |
… | …010111011010100001001 |
3 | 21111000211022002111002121 |
4 | 132300023022323110021 |
5 | 234111030144322101 |
6 | 4254501455531241 |
7 | 305452552601425 |
oct | 36601312732411 |
9 | 7430738074077 |
10 | 2113311323401 |
11 | 74528316a203 |
12 | 2a16a7829b21 |
13 | 124390aa9625 |
14 | 743db759b85 |
15 | 39e8ab630a1 |
hex | 1ec0b2bb509 |
2113311323401 has 2 divisors, whose sum is σ = 2113311323402. Its totient is φ = 2113311323400.
The previous prime is 2113311323399. The next prime is 2113311323419. The reversal of 2113311323401 is 1043231133112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1688336409600 + 424974913801 = 1299360^2 + 651901^2 .
It is a cyclic number.
It is not a de Polignac number, because 2113311323401 - 21 = 2113311323399 is a prime.
It is a super-2 number, since 2×21133113234012 (a number of 25 digits) contains 22 as substring.
Together with 2113311323399, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2113311333401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1056655661700 + 1056655661701.
It is an arithmetic number, because the mean of its divisors is an integer number (1056655661701).
Almost surely, 22113311323401 is an apocalyptic number.
It is an amenable number.
2113311323401 is a deficient number, since it is larger than the sum of its proper divisors (1).
2113311323401 is an equidigital number, since it uses as much as digits as its factorization.
2113311323401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 2113311323401 its reverse (1043231133112), we get a palindrome (3156542456513).
The spelling of 2113311323401 in words is "two trillion, one hundred thirteen billion, three hundred eleven million, three hundred twenty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •