Base | Representation |
---|---|
bin | 11110110000010001110… |
… | …101010111110001110011 |
3 | 21111001010002110000001101 |
4 | 132300101311113301303 |
5 | 234111242304111311 |
6 | 4254520531545231 |
7 | 305455411026535 |
oct | 36602165276163 |
9 | 7431102400041 |
10 | 2113423113331 |
11 | 745330283682 |
12 | 2a171915b217 |
13 | 1243aacba60a |
14 | 7440c539855 |
15 | 39e95895ec1 |
hex | 1ec11d57c73 |
2113423113331 has 2 divisors, whose sum is σ = 2113423113332. Its totient is φ = 2113423113330.
The previous prime is 2113423113317. The next prime is 2113423113337. The reversal of 2113423113331 is 1333113243112.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2113423113331 - 29 = 2113423112819 is a prime.
It is a super-2 number, since 2×21134231133312 (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 2113423113331.
It is not a weakly prime, because it can be changed into another prime (2113423113337) 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, 1056711556665 + 1056711556666.
It is an arithmetic number, because the mean of its divisors is an integer number (1056711556666).
Almost surely, 22113423113331 is an apocalyptic number.
2113423113331 is a deficient number, since it is larger than the sum of its proper divisors (1).
2113423113331 is an equidigital number, since it uses as much as digits as its factorization.
2113423113331 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3888, while the sum is 28.
Adding to 2113423113331 its reverse (1333113243112), we get a palindrome (3446536356443).
The spelling of 2113423113331 in words is "two trillion, one hundred thirteen billion, four hundred twenty-three million, one hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •