Search a number
-
+
56051105054947 is a prime number
BaseRepresentation
bin11001011111010011010100…
…01101001100000011100011
321100110102200212212121001221
430233221222031030003203
524321320130343224242
6315113304443035511
714543362430633512
oct1457515215140343
9240412625777057
1056051105054947
111695015a610742
1263530b580bb97
13253779a753252
14dbac607c0679
156730404c1167
hex32fa6a34c0e3

56051105054947 has 2 divisors, whose sum is σ = 56051105054948. Its totient is φ = 56051105054946.

The previous prime is 56051105054929. The next prime is 56051105054951. The reversal of 56051105054947 is 74945050115065.

56051105054947 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 56051105054947 - 215 = 56051105022179 is a prime.

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

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

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

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

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

Almost surely, 256051105054947 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3780000, while the sum is 52.

The spelling of 56051105054947 in words is "fifty-six trillion, fifty-one billion, one hundred five million, fifty-four thousand, nine hundred forty-seven".