Search a number
-
+
5005250000050 = 252100105000001
BaseRepresentation
bin100100011010110000000…
…1001011111010010110010
3122201111102110220202120111
41020311200021133102302
51124001223000000200
614351214034131534
71024421522011546
oct110654011372262
918644373822514
105005250000050
11165a795158283
1268a074120baa
132a3cba965581
14134380b23a26
158a2e85ac0ba
hex48d6025f4b2

5005250000050 has 12 divisors (see below), whose sum is σ = 9309765000186. Its totient is φ = 2002100000000.

The previous prime is 5005250000011. The next prime is 5005250000063. The reversal of 5005250000050 is 500000525005.

It can be written as a sum of positive squares in 3 ways, for example, as 2497882259961 + 2507367740089 = 1580469^2 + 1583467^2 .

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

It is an unprimeable number.

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 in 5 ways as a sum of consecutive naturals, for example, 50052499951 + ... + 50052500050.

Almost surely, 25005250000050 is an apocalyptic number.

5005250000050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.

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

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

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

The sum of its prime factors is 100105000013 (or 100105000008 counting only the distinct ones).

The product of its (nonzero) digits is 1250, while the sum is 22.

Adding to 5005250000050 its reverse (500000525005), we get a palindrome (5505250525055).

The spelling of 5005250000050 in words is "five trillion, five billion, two hundred fifty million, fifty", and thus it is an aban number.

Divisors: 1 2 5 10 25 50 100105000001 200210000002 500525000005 1001050000010 2502625000025 5005250000050