Search a number
-
+
5005554999469 is a prime number
BaseRepresentation
bin100100011010111001001…
…0100111110000010101101
3122201112012201211100010021
41020311302110332002231
51124002334034440334
614351304211242141
71024432214322643
oct110656224760255
918645181740107
105005554999469
11165a931336912
1268a13a2a9351
132a4038bc3abb
141343ad439193
158a3152573b4
hex48d7253e0ad

5005554999469 has 2 divisors, whose sum is σ = 5005554999470. Its totient is φ = 5005554999468.

The previous prime is 5005554999301. The next prime is 5005554999481. The reversal of 5005554999469 is 9649994555005.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 3981740884900 + 1023814114569 = 1995430^2 + 1011837^2 .

It is a cyclic number.

It is not a de Polignac number, because 5005554999469 - 217 = 5005554868397 is a prime.

It is a super-3 number, since 3×50055549994693 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

It is a congruent number.

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

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

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

Almost surely, 25005554999469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 393660000, while the sum is 70.

The spelling of 5005554999469 in words is "five trillion, five billion, five hundred fifty-four million, nine hundred ninety-nine thousand, four hundred sixty-nine".