Search a number
-
+
48615947 is a prime number
BaseRepresentation
bin1011100101110…
…1001000001011
310101110221112122
42321131020023
544421202242
64454001455
71130141312
oct271351013
9111427478
1048615947
1125495976
121434628b
13a0c2443
146657279
154404ad2
hex2e5d20b

48615947 has 2 divisors, whose sum is σ = 48615948. Its totient is φ = 48615946.

The previous prime is 48615913. The next prime is 48615953. The reversal of 48615947 is 74951684.

48615947 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 not a de Polignac number, because 48615947 - 212 = 48611851 is a prime.

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 48615898 and 48615907.

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

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

Almost surely, 248615947 is an apocalyptic number.

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

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

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

The product of its digits is 241920, while the sum is 44.

The square root of 48615947 is about 6972.5136787245. The cubic root of 48615947 is about 364.9720301330.

The spelling of 48615947 in words is "forty-eight million, six hundred fifteen thousand, nine hundred forty-seven".