Base | Representation |
---|---|
bin | 11101101110001011000… |
… | …110010001111110110111 |
3 | 21020020220101010000112201 |
4 | 131232023012101332313 |
5 | 231430410421121033 |
6 | 4202141352525331 |
7 | 300363434200012 |
oct | 35561306217667 |
9 | 7206811100481 |
10 | 2042443145143 |
11 | 7182169aaa45 |
12 | 28ba0a0b0847 |
13 | 11a7a882a83b |
14 | 70bd770c379 |
15 | 381de20e47d |
hex | 1db8b191fb7 |
2042443145143 has 4 divisors (see below), whose sum is σ = 2042481650040. Its totient is φ = 2042404640248.
The previous prime is 2042443145137. The next prime is 2042443145177. The reversal of 2042443145143 is 3415413442402.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2042443145143 is a prime.
It is a super-2 number, since 2×20424431451432 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2042443145843) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19172773 + ... + 19279006.
It is an arithmetic number, because the mean of its divisors is an integer number (510620412510).
Almost surely, 22042443145143 is an apocalyptic number.
2042443145143 is a deficient number, since it is larger than the sum of its proper divisors (38504897).
2042443145143 is an equidigital number, since it uses as much as digits as its factorization.
2042443145143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38504896.
The product of its (nonzero) digits is 184320, while the sum is 37.
Adding to 2042443145143 its reverse (3415413442402), we get a palindrome (5457856587545).
The spelling of 2042443145143 in words is "two trillion, forty-two billion, four hundred forty-three million, one hundred forty-five thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •