Search a number
-
+
2580968021 is a prime number
BaseRepresentation
bin1001100111010110…
…0111001001010101
320122212112202112012
42121311213021111
520241211434041
61104035034005
7120646603052
oct23165471125
96585482465
102580968021
111104986525
1260043b905
1332193b318
141a6aca029
151018c13eb
hex99d67255

2580968021 has 2 divisors, whose sum is σ = 2580968022. Its totient is φ = 2580968020.

The previous prime is 2580968009. The next prime is 2580968053. The reversal of 2580968021 is 1208690852.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 2385247921 + 195720100 = 48839^2 + 13990^2 .

It is a cyclic number.

It is not a de Polignac number, because 2580968021 - 230 = 1507226197 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 2580968021.

It is a congruent number.

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

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

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

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

Almost surely, 22580968021 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 2580968021 is about 50803.2284505621. The cubic root of 2580968021 is about 1371.7054826932.

The spelling of 2580968021 in words is "two billion, five hundred eighty million, nine hundred sixty-eight thousand, twenty-one".