Search a number
-
+
5005101010969 is a prime number
BaseRepresentation
bin100100011010101011101…
…0001001001000000011001
3122201111001002120022222101
41020311113101021000121
51124000421324322334
614351151152523401
71024415032432213
oct110652721110031
918644032508871
105005101010969
11165a719046604
1268a032250561
132a3c95b2b857
1413436901d5b3
158a2da47c214
hex48d57449019

5005101010969 has 2 divisors, whose sum is σ = 5005101010970. Its totient is φ = 5005101010968.

The previous prime is 5005101010963. The next prime is 5005101011011. The reversal of 5005101010969 is 9690101015005.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 3168086727744 + 1837014283225 = 1779912^2 + 1355365^2 .

It is a cyclic number.

It is not a de Polignac number, because 5005101010969 - 215 = 5005100978201 is a prime.

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

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

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

Almost surely, 25005101010969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12150, while the sum is 37.

The spelling of 5005101010969 in words is "five trillion, five billion, one hundred one million, ten thousand, nine hundred sixty-nine".