Search a number
-
+
5006005005601 is a prime number
BaseRepresentation
bin100100011011000110100…
…1001100110110100100001
3122201120101002121000111001
41020312031021212310201
51124004244240134401
614351421004352001
71024446320316115
oct110661511466441
918646332530431
105006005005601
111660042357106
1268a244b45601
132a40ab1c3512
141344130d9745
158a33e9e7601
hex48d8d266d21

5006005005601 has 2 divisors, whose sum is σ = 5006005005602. Its totient is φ = 5006005005600.

The previous prime is 5006005005527. The next prime is 5006005005641. The reversal of 5006005005601 is 1065005006005.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4686146892001 + 319858113600 = 2164751^2 + 565560^2 .

It is a cyclic number.

It is not a de Polignac number, because 5006005005601 - 211 = 5006005003553 is a prime.

It is a super-2 number, since 2×50060050056012 (a number of 26 digits) contains 22 as substring.

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

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

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

Almost surely, 25006005005601 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4500, while the sum is 28.

The spelling of 5006005005601 in words is "five trillion, six billion, five million, five thousand, six hundred one".