Search a number
-
+
48523367 is a prime number
BaseRepresentation
bin1011100100011…
…0100001100111
310101022020112202
42321012201213
544410221432
64452005115
71126304354
oct271064147
9111266482
1048523367
1125432362
121430079b
13a08c269
14663162b
1543d7462
hex2e46867

48523367 has 2 divisors, whose sum is σ = 48523368. Its totient is φ = 48523366.

The previous prime is 48523357. The next prime is 48523369. The reversal of 48523367 is 76332584.

48523367 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 48523367 - 26 = 48523303 is a prime.

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

It is a Chen prime.

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

It is a congruent number.

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

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

Almost surely, 248523367 is an apocalyptic number.

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

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

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

The product of its digits is 120960, while the sum is 38.

The square root of 48523367 is about 6965.8715893993. The cubic root of 48523367 is about 364.7402092065.

The spelling of 48523367 in words is "forty-eight million, five hundred twenty-three thousand, three hundred sixty-seven".