Search a number
-
+
48550091 is a prime number
BaseRepresentation
bin1011100100110…
…1000011001011
310101100121012112
42321031003023
544412100331
64452332535
71126445312
oct271150313
9111317175
1048550091
1125450447
121431414b
13a09b485
14663b279
1543e032b
hex2e4d0cb

48550091 has 2 divisors, whose sum is σ = 48550092. Its totient is φ = 48550090.

The previous prime is 48550069. The next prime is 48550093. The reversal of 48550091 is 19005584.

48550091 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-48550091 is a prime.

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

It is a Sophie Germain prime.

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

It is a Chen prime.

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

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

Almost surely, 248550091 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 7200, while the sum is 32.

The square root of 48550091 is about 6967.7895347090. The cubic root of 48550091 is about 364.8071565288.

The spelling of 48550091 in words is "forty-eight million, five hundred fifty thousand, ninety-one".