Search a number
-
+
49563361 is a prime number
BaseRepresentation
bin1011110100010…
…0011011100001
310110021002011001
42331010123201
5100142011421
64530152001
71141165411
oct275043341
9113232131
1049563361
1125a82761
1214722601
13a364743
146822641
154540691
hex2f446e1

49563361 has 2 divisors, whose sum is σ = 49563362. Its totient is φ = 49563360.

The previous prime is 49563359. The next prime is 49563373. The reversal of 49563361 is 16336594.

49563361 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 39450961 + 10112400 = 6281^2 + 3180^2 .

It is a cyclic number.

It is not a de Polignac number, because 49563361 - 21 = 49563359 is a prime.

Together with 49563359, it forms a pair of twin primes.

It is a self number, because there is not a number n which added to its sum of digits gives 49563361.

It is not a weakly prime, because it can be changed into another prime (49563331) 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, 24781680 + 24781681.

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

Almost surely, 249563361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 58320, while the sum is 37.

The square root of 49563361 is about 7040.1250699118. The cubic root of 49563361 is about 367.3276184155.

The spelling of 49563361 in words is "forty-nine million, five hundred sixty-three thousand, three hundred sixty-one".