Search a number
-
+
48564947 is a prime number
BaseRepresentation
bin1011100101000…
…0101011010011
310101101100120202
42321100223103
544413034242
64452525415
71126536524
oct271205323
9111340522
1048564947
1125460622
121432086b
13a0a5172
14664284b
1543e4932
hex2e50ad3

48564947 has 2 divisors, whose sum is σ = 48564948. Its totient is φ = 48564946.

The previous prime is 48564913. The next prime is 48564953. The reversal of 48564947 is 74946584.

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

It is a strong prime.

It is a cyclic number.

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

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

It is a Chen prime.

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

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

Almost surely, 248564947 is an apocalyptic number.

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

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

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

The product of its digits is 967680, while the sum is 47.

The square root of 48564947 is about 6968.8555014435. The cubic root of 48564947 is about 364.8443622430.

The spelling of 48564947 in words is "forty-eight million, five hundred sixty-four thousand, nine hundred forty-seven".