Search a number
-
+
2741015642 = 21370507821
BaseRepresentation
bin1010001101100000…
…1001010001011010
321002000201000120212
42203120021101122
521103200000032
61131553251122
7124632151151
oct24330112132
97060630525
102741015642
111187260692
12645b63aa2
13348b47661
141c006c598
15110987bb2
hexa360945a

2741015642 has 4 divisors (see below), whose sum is σ = 4111523466. Its totient is φ = 1370507820.

The previous prime is 2741015623. The next prime is 2741015647. The reversal of 2741015642 is 2465101472.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in only one way, i.e., 1884341281 + 856674361 = 43409^2 + 29269^2 .

It is a junction number, because it is equal to n+sod(n) for n = 2741015599 and 2741015608.

It is not an unprimeable number, because it can be changed into a prime (2741015647) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 685253909 + ... + 685253912.

Almost surely, 22741015642 is an apocalyptic number.

2741015642 is a deficient number, since it is larger than the sum of its proper divisors (1370507824).

2741015642 is a wasteful number, since it uses less digits than its factorization.

2741015642 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 1370507823.

The product of its (nonzero) digits is 13440, while the sum is 32.

The square root of 2741015642 is about 52354.7098358877. The cubic root of 2741015642 is about 1399.4922720106.

The spelling of 2741015642 in words is "two billion, seven hundred forty-one million, fifteen thousand, six hundred forty-two".

Divisors: 1 2 1370507821 2741015642