[go: up one dir, main page]

Search a number
-
+
2940393 = 3980131
BaseRepresentation
bin1011001101110111101001
312112101110110
423031313221
51223043033
6143004533
733664401
oct13156751
95471413
102940393
111729185
12b99749
137bc4a1
14567801
153d1363
hex2cdde9

2940393 has 4 divisors (see below), whose sum is σ = 3920528. Its totient is φ = 1960260.

The previous prime is 2940391. The next prime is 2940401. The reversal of 2940393 is 3930492.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 2940393 - 21 = 2940391 is a prime.

It is a D-number.

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 2940393.

It is not an unprimeable number, because it can be changed into a prime (2940391) 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, 490063 + ... + 490068.

It is an arithmetic number, because the mean of its divisors is an integer number (980132).

22940393 is an apocalyptic number.

It is an amenable number.

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

2940393 is an equidigital number, since it uses as much as digits as its factorization.

2940393 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 980134.

The product of its (nonzero) digits is 5832, while the sum is 30.

The square root of 2940393 is about 1714.7574172459. The cubic root of 2940393 is about 143.2633580677.

Subtracting 2940393 from its reverse (3930492), we obtain a palindrome (990099).

It can be divided in two parts, 2940 and 393, that added together give a palindrome (3333).

The spelling of 2940393 in words is "two million, nine hundred forty thousand, three hundred ninety-three".

Divisors: 1 3 980131 2940393