Search a number
-
+
48964269553 is a prime number
BaseRepresentation
bin101101100110011111…
…110111010111110001
311200101101220121112221
4231212133313113301
51300234323111203
634254402121041
73352244265313
oct554637672761
9150341817487
1048964269553
1119847065481
1295a6050181
134804302484
142526d617b3
1514189a6abd
hexb667f75f1

48964269553 has 2 divisors, whose sum is σ = 48964269554. Its totient is φ = 48964269552.

The previous prime is 48964269551. The next prime is 48964269589. The reversal of 48964269553 is 35596246984.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 32455103409 + 16509166144 = 180153^2 + 128488^2 .

It is a cyclic number.

It is not a de Polignac number, because 48964269553 - 21 = 48964269551 is a prime.

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

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

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

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

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

Almost surely, 248964269553 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 55987200, while the sum is 61.

The spelling of 48964269553 in words is "forty-eight billion, nine hundred sixty-four million, two hundred sixty-nine thousand, five hundred fifty-three".