[go: up one dir, main page]

Search a number
-
+
5164056241 is a prime number
BaseRepresentation
bin1001100111100110…
…10011111010110001
3111022220002020102021
410303303103322301
541033444244431
62212231351441
7241653516361
oct46363237261
914286066367
105164056241
11220aa7a983
121001522581
13643b3c6a6
1436dba89a1
15203560b11
hex133cd3eb1

5164056241 has 2 divisors, whose sum is σ = 5164056242. Its totient is φ = 5164056240.

The previous prime is 5164056211. The next prime is 5164056253. The reversal of 5164056241 is 1426504615.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4959680625 + 204375616 = 70425^2 + 14296^2 .

It is a cyclic number.

It is not a de Polignac number, because 5164056241 - 223 = 5155667633 is a prime.

It is a super-2 number, since 2×51640562412 = 53334953720422100162, which contains 22 as substring.

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

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

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

Almost surely, 25164056241 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 28800, while the sum is 34.

The square root of 5164056241 is about 71861.3682099082. The cubic root of 5164056241 is about 1728.4771970654.

The spelling of 5164056241 in words is "five billion, one hundred sixty-four million, fifty-six thousand, two hundred forty-one".