Search a number
-
+
56146750061 is a prime number
BaseRepresentation
bin110100010010100110…
…110110101001101101
312100220222000102112112
4310102212312221231
51404442032000221
641443215413405
74025240333603
oct642246665155
9170828012475
1056146750061
11218a2416386
12aa6b524265
1353aa36a33c
142a08c1d873
1516d931915b
hexd129b6a6d

56146750061 has 2 divisors, whose sum is σ = 56146750062. Its totient is φ = 56146750060.

The previous prime is 56146749977. The next prime is 56146750063. The reversal of 56146750061 is 16005764165.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 50447406025 + 5699344036 = 224605^2 + 75494^2 .

It is a cyclic number.

It is not a de Polignac number, because 56146750061 - 210 = 56146749037 is a prime.

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

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 256146750061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 151200, while the sum is 41.

The spelling of 56146750061 in words is "fifty-six billion, one hundred forty-six million, seven hundred fifty thousand, sixty-one".