Search a number
-
+
48936131 is a prime number
BaseRepresentation
bin1011101010101…
…1010011000011
310102002012202022
42322223103003
5100011424011
64504512055
71132643636
oct272532303
9112065668
1048936131
1125694492
121447b62b
13a1a50ba
1466dbc1d
1544698db
hex2eab4c3

48936131 has 2 divisors, whose sum is σ = 48936132. Its totient is φ = 48936130.

The previous prime is 48936127. The next prime is 48936133. The reversal of 48936131 is 13163984.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 48936131 - 22 = 48936127 is a prime.

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

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

It is a Chen prime.

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

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

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

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

Almost surely, 248936131 is an apocalyptic number.

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

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

48936131 is an evil number, because the sum of its binary digits is even.

The product of its digits is 15552, while the sum is 35.

The square root of 48936131 is about 6995.4364409949. The cubic root of 48936131 is about 365.7715112637.

The spelling of 48936131 in words is "forty-eight million, nine hundred thirty-six thousand, one hundred thirty-one".