Base | Representation |
---|---|
bin | 1010001101010001… |
… | …1011110011100101 |
3 | 21001221212121100101 |
4 | 2203110123303211 |
5 | 21102422333411 |
6 | 1131520344101 |
7 | 124620660334 |
oct | 24324336345 |
9 | 7057777311 |
10 | 2740042981 |
11 | 1186756935 |
12 | 645775031 |
13 | 348896a10 |
14 | 1bdc97d1b |
15 | 1108448c1 |
hex | a351bce5 |
2740042981 has 16 divisors (see below), whose sum is σ = 2995977600. Its totient is φ = 2490844608.
The previous prime is 2740042967. The next prime is 2740042999. The reversal of 2740042981 is 1892400472.
It is a cyclic number.
It is not a de Polignac number, because 2740042981 - 27 = 2740042853 is a prime.
It is a super-2 number, since 2×27400429812 = 15015671075454732722, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2740042981.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2740042901) 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 15 ways as a sum of consecutive naturals, for example, 230850 + ... + 242428.
It is an arithmetic number, because the mean of its divisors is an integer number (187248600).
Almost surely, 22740042981 is an apocalyptic number.
It is an amenable number.
2740042981 is a deficient number, since it is larger than the sum of its proper divisors (255934619).
2740042981 is a wasteful number, since it uses less digits than its factorization.
2740042981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11868.
The product of its (nonzero) digits is 32256, while the sum is 37.
The square root of 2740042981 is about 52345.4198664983. The cubic root of 2740042981 is about 1399.3267138410.
The spelling of 2740042981 in words is "two billion, seven hundred forty million, forty-two thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •