[go: up one dir, main page]

Search a number
-
+
48513011 is a prime number
BaseRepresentation
bin1011100100001…
…1111111110011
310101021201100012
42321003333303
544404404021
64451445135
71126232231
oct271037763
9111251305
1048513011
11254255a8
12142b67ab
13a087631
14662b951
1543d435b
hex2e43ff3

48513011 has 2 divisors, whose sum is σ = 48513012. Its totient is φ = 48513010.

The previous prime is 48512993. The next prime is 48513013. The reversal of 48513011 is 11031584.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 48513011 - 210 = 48511987 is a prime.

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

Together with 48513013, 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 (48513013) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 248513011 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 480, while the sum is 23.

The square root of 48513011 is about 6965.1282113110. The cubic root of 48513011 is about 364.7142593835.

Adding to 48513011 its reverse (11031584), we get a palindrome (59544595).

The spelling of 48513011 in words is "forty-eight million, five hundred thirteen thousand, eleven".