Base | Representation |
---|---|
bin | 1010001101111101… |
… | …0001001101000111 |
3 | 21002011012220022120 |
4 | 2203133101031013 |
5 | 21104134230033 |
6 | 1132101301023 |
7 | 124654056600 |
oct | 24337211507 |
9 | 7064186276 |
10 | 2742883143 |
11 | 1188316780 |
12 | 646704773 |
13 | 34934c6a0 |
14 | 1c03d6da7 |
15 | 110c061b3 |
hex | a37d1347 |
2742883143 has 48 divisors (see below), whose sum is σ = 4998059136. Its totient is φ = 1315258560.
The previous prime is 2742883141. The next prime is 2742883163. The reversal of 2742883143 is 3413882472.
It is a happy number.
It is not a de Polignac number, because 2742883143 - 21 = 2742883141 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 2742883095 and 2742883104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2742883141) 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 in 47 ways as a sum of consecutive naturals, for example, 44221 + ... + 86262.
It is an arithmetic number, because the mean of its divisors is an integer number (104126232).
Almost surely, 22742883143 is an apocalyptic number.
2742883143 is a deficient number, since it is larger than the sum of its proper divisors (2255175993).
2742883143 is a wasteful number, since it uses less digits than its factorization.
2742883143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130524 (or 130517 counting only the distinct ones).
The product of its digits is 258048, while the sum is 42.
The square root of 2742883143 is about 52372.5418802639. The cubic root of 2742883143 is about 1399.8100325576.
The spelling of 2742883143 in words is "two billion, seven hundred forty-two million, eight hundred eighty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •