Base | Representation |
---|---|
bin | 11110110000001011110… |
… | …100011011101110010011 |
3 | 21111000212001120021112122 |
4 | 132300023310123232103 |
5 | 234111040441012201 |
6 | 4254502525044455 |
7 | 305453044226432 |
oct | 36601364335623 |
9 | 7430761507478 |
10 | 2113322204051 |
11 | 745289320a83 |
12 | 2a16ab3b672b |
13 | 124393118c96 |
14 | 743dcd8d119 |
15 | 39e8bab1e1b |
hex | 1ec0bd1bb93 |
2113322204051 has 2 divisors, whose sum is σ = 2113322204052. Its totient is φ = 2113322204050.
The previous prime is 2113322204027. The next prime is 2113322204087. The reversal of 2113322204051 is 1504022233112.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2113322204051 is a prime.
It is a super-2 number, since 2×21133222040512 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2113322204051.
It is not a weakly prime, because it can be changed into another prime (2113322209051) 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, 1056661102025 + 1056661102026.
It is an arithmetic number, because the mean of its divisors is an integer number (1056661102026).
Almost surely, 22113322204051 is an apocalyptic number.
2113322204051 is a deficient number, since it is larger than the sum of its proper divisors (1).
2113322204051 is an equidigital number, since it uses as much as digits as its factorization.
2113322204051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 2113322204051 its reverse (1504022233112), we get a palindrome (3617344437163).
The spelling of 2113322204051 in words is "two trillion, one hundred thirteen billion, three hundred twenty-two million, two hundred four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •