Search a number
-
+
49056013 is a prime number
BaseRepresentation
bin1011101100100…
…0100100001101
310102022022012101
42323020210031
5100024243023
64511235101
71133653306
oct273104415
9112268171
1049056013
1125766566
1214518a91
13a217836
14672d7ad
1544901ad
hex2ec890d

49056013 has 2 divisors, whose sum is σ = 49056014. Its totient is φ = 49056012.

The previous prime is 49055977. The next prime is 49056037. The reversal of 49056013 is 31065094.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 47513449 + 1542564 = 6893^2 + 1242^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-49056013 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (49056113) by changing a digit.

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

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

Almost surely, 249056013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3240, while the sum is 28.

The square root of 49056013 is about 7003.9997858367. Note that the first 3 decimals coincide. The cubic root of 49056013 is about 366.0699523893.

The spelling of 49056013 in words is "forty-nine million, fifty-six thousand, thirteen".