Search a number
-
+
505672151053 is a prime number
BaseRepresentation
bin1110101101111000110…
…10001011000000001101
31210100020011100211201011
413112330122023000031
531241104032313203
61024145205045221
751351012236026
oct7267432130015
91710204324634
10505672151053
111854aa823543
12820046b6811
13388b9317b84
141a69068dc4d
15d248aaa76d
hex75bc68b00d

505672151053 has 2 divisors, whose sum is σ = 505672151054. Its totient is φ = 505672151052.

The previous prime is 505672151051. The next prime is 505672151071. The reversal of 505672151053 is 350151276505.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 354088072809 + 151584078244 = 595053^2 + 389338^2 .

It is a cyclic number.

It is not a de Polignac number, because 505672151053 - 21 = 505672151051 is a prime.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 2505672151053 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 157500, while the sum is 40.

The spelling of 505672151053 in words is "five hundred five billion, six hundred seventy-two million, one hundred fifty-one thousand, fifty-three".