Search a number
-
+
5671011641 is a prime number
BaseRepresentation
bin1010100100000010…
…01100010100111001
3112122020000020111012
411102001030110321
543103234333031
62334421243305
7260350542431
oct52201142471
915566006435
105671011641
112450157a89
121123263535
136c4b8b5b9
143bb2512c1
15232ceeb2b
hex15204c539

5671011641 has 2 divisors, whose sum is σ = 5671011642. Its totient is φ = 5671011640.

The previous prime is 5671011553. The next prime is 5671011649. The reversal of 5671011641 is 1461101765.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5670692416 + 319225 = 75304^2 + 565^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-5671011641 is a prime.

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

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

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

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

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

Almost surely, 25671011641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5040, while the sum is 32.

The square root of 5671011641 is about 75306.1195454924. The cubic root of 5671011641 is about 1783.2826309359.

The spelling of 5671011641 in words is "five billion, six hundred seventy-one million, eleven thousand, six hundred forty-one".