Search a number
-
+
100556250050 = 2522011125001
BaseRepresentation
bin101110110100110011…
…1101001101111000010
3100121112221022202212102
41131221213221233002
53121414400000200
6114110033230402
710156610010524
oct1355147515702
9317487282772
10100556250050
1139711421a93
12175a4102402
139636b2a999
144c1cc99a14
152937eb46d5
hex17699e9bc2

100556250050 has 12 divisors (see below), whose sum is σ = 187034625186. Its totient is φ = 40222500000.

The previous prime is 100556250043. The next prime is 100556250073. The reversal of 100556250050 is 50052655001.

It can be written as a sum of positive squares in 3 ways, for example, as 38654312449 + 61901937601 = 196607^2 + 248801^2 .

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

It is a Curzon number.

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

It is an unprimeable number.

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1005562451 + ... + 1005562550.

Almost surely, 2100556250050 is an apocalyptic number.

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

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

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

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

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

The product of its (nonzero) digits is 7500, while the sum is 29.

The spelling of 100556250050 in words is "one hundred billion, five hundred fifty-six million, two hundred fifty thousand, fifty".

Divisors: 1 2 5 10 25 50 2011125001 4022250002 10055625005 20111250010 50278125025 100556250050