Search a number
-
+
505672151051 is a prime number
BaseRepresentation
bin1110101101111000110…
…10001011000000001011
31210100020011100211201002
413112330122023000023
531241104032313201
61024145205045215
751351012236024
oct7267432130013
91710204324632
10505672151051
111854aa823541
12820046b680b
13388b9317b82
141a69068dc4b
15d248aaa76b
hex75bc68b00b

505672151051 has 2 divisors, whose sum is σ = 505672151052. Its totient is φ = 505672151050.

The previous prime is 505672151029. The next prime is 505672151053. The reversal of 505672151051 is 150151276505.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 505672151051 - 222 = 505667956747 is a prime.

Together with 505672151053, 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 = 505672150996 and 505672151014.

It is not a weakly prime, because it can be changed into another prime (505672151053) 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, 252836075525 + 252836075526.

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

Almost surely, 2505672151051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 52500, while the sum is 38.

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