Search a number
-
+
49052391 = 316350797
BaseRepresentation
bin1011101100011…
…1101011100111
310102022010020020
42323013223213
5100024134031
64511210223
71133636613
oct273075347
9112263206
1049052391
1125763873
1214516973
13a215cab
14672c343
15448e096
hex2ec7ae7

49052391 has 4 divisors (see below), whose sum is σ = 65403192. Its totient is φ = 32701592.

The previous prime is 49052387. The next prime is 49052407. The reversal of 49052391 is 19325094.

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

It is a cyclic number.

It is not a de Polignac number, because 49052391 - 22 = 49052387 is a prime.

It is a super-2 number, since 2×490523912 = 4812274125633762, which contains 22 as substring.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (49052321) 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 3 ways as a sum of consecutive naturals, for example, 8175396 + ... + 8175401.

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

Almost surely, 249052391 is an apocalyptic number.

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

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

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

The sum of its prime factors is 16350800.

The product of its (nonzero) digits is 9720, while the sum is 33.

The square root of 49052391 is about 7003.7412145224. The cubic root of 49052391 is about 366.0609427021.

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

Divisors: 1 3 16350797 49052391