Search a number
-
+
500100506105 = 5100020101221
BaseRepresentation
bin1110100011100000101…
…00000010000111111001
31202210211212022221200212
413101300110002013321
531143201212143410
61021424253240505
751062646110144
oct7216024020771
91683755287625
10500100506105
111831007751a2
1280b0a793135
133820bc0aa45
141a2c270705b
15d01e887b05
hex74705021f9

500100506105 has 4 divisors (see below), whose sum is σ = 600120607332. Its totient is φ = 400080404880.

The previous prime is 500100506099. The next prime is 500100506123. The reversal of 500100506105 is 501605001005.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 501605001005 = 5100321000201.

It can be written as a sum of positive squares in 2 ways, for example, as 371196529081 + 128903977024 = 609259^2 + 359032^2 .

It is not a de Polignac number, because 500100506105 - 216 = 500100440569 is a prime.

It is a Duffinian number.

It is an unprimeable number.

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 in 3 ways as a sum of consecutive naturals, for example, 50010050606 + ... + 50010050615.

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

Almost surely, 2500100506105 is an apocalyptic number.

It is an amenable number.

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

500100506105 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 100020101226.

The product of its (nonzero) digits is 750, while the sum is 23.

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

Divisors: 1 5 100020101221 500100506105