Search a number
-
+
563001336669151 is a prime number
BaseRepresentation
bin1000000000000010111111011…
…0101011100010001111011111
32201211102101212011102021012201
42000000233312223202033133
51042243203214141403101
65313223124333112331
7226405334652024142
oct20000576653421737
92654371764367181
10563001336669151
111534315871539a6
12531895206286a7
131b21ba4b978763
149d055a53d4059
154514e54229e01
hex2000bf6ae23df

563001336669151 has 2 divisors, whose sum is σ = 563001336669152. Its totient is φ = 563001336669150.

The previous prime is 563001336669143. The next prime is 563001336669169. The reversal of 563001336669151 is 151966633100365.

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

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 563001336669151 - 23 = 563001336669143 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2563001336669151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 7873200, while the sum is 55.

The spelling of 563001336669151 in words is "five hundred sixty-three trillion, one billion, three hundred thirty-six million, six hundred sixty-nine thousand, one hundred fifty-one".