Search a number
-
+
48919613 is a prime number
BaseRepresentation
bin1011101010011…
…1010000111101
310102001101002112
42322213100331
5100010411423
64504303405
71132544531
oct272472075
9112041075
1048919613
1125683036
1214471b65
13a19a722
1466d5bc1
154464a78
hex2ea743d

48919613 has 2 divisors, whose sum is σ = 48919614. Its totient is φ = 48919612.

The previous prime is 48919589. The next prime is 48919627. The reversal of 48919613 is 31691984.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 38278969 + 10640644 = 6187^2 + 3262^2 .

It is a cyclic number.

It is not a de Polignac number, because 48919613 - 222 = 44725309 is a prime.

It is a Chen prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (48918613) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24459806 + 24459807.

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

Almost surely, 248919613 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 46656, while the sum is 41.

The square root of 48919613 is about 6994.2557145132. The cubic root of 48919613 is about 365.7303522154.

It can be divided in two parts, 489 and 19613, that added together give a palindrome (20102).

The spelling of 48919613 in words is "forty-eight million, nine hundred nineteen thousand, six hundred thirteen".