Base | Representation |
---|---|
bin | 11101101111000000000… |
… | …101100010000001101001 |
3 | 21020100012022220200211011 |
4 | 131233000011202001221 |
5 | 231434221012004121 |
6 | 4202405511103521 |
7 | 300424450425103 |
oct | 35570005420151 |
9 | 7210168820734 |
10 | 2043332141161 |
11 | 7186327a68a3 |
12 | 290017971ba1 |
13 | 11a8baa7069c |
14 | 70c7d802573 |
15 | 382422b57e1 |
hex | 1dbc0162069 |
2043332141161 has 2 divisors, whose sum is σ = 2043332141162. Its totient is φ = 2043332141160.
The previous prime is 2043332141159. The next prime is 2043332141173. The reversal of 2043332141161 is 1611412333402.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1831640131161 + 211692010000 = 1353381^2 + 460100^2 .
It is a cyclic number.
It is not a de Polignac number, because 2043332141161 - 21 = 2043332141159 is a prime.
Together with 2043332141159, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2143332141161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1021666070580 + 1021666070581.
It is an arithmetic number, because the mean of its divisors is an integer number (1021666070581).
Almost surely, 22043332141161 is an apocalyptic number.
It is an amenable number.
2043332141161 is a deficient number, since it is larger than the sum of its proper divisors (1).
2043332141161 is an equidigital number, since it uses as much as digits as its factorization.
2043332141161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 2043332141161 its reverse (1611412333402), we get a palindrome (3654744474563).
The spelling of 2043332141161 in words is "two trillion, forty-three billion, three hundred thirty-two million, one hundred forty-one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •