Search a number
-
+
100000100000 = 25551019901
BaseRepresentation
bin101110100100001111…
…0000110111010100000
3100120010011211102102102
41131020132012322200
53114300011200000
6113534525105532
710140044553023
oct1351036067240
9316104742372
10100000100000
11394564a4249
12174699b82a8
139578846108
144ba90891ba
1529042593d5
hex1748786ea0

100000100000 has 144 divisors (see below), whose sum is σ = 248539764312. Its totient is φ = 39600000000.

The previous prime is 100000099963. The next prime is 100000100009. The reversal of 100000100000 is 1000001.

It can be written as a sum of positive squares in 12 ways, for example, as 2613663376 + 97386436624 = 51124^2 + 312068^2 .

It is a sliding number, since 100000100000 = 100000 + 100000000000 and 1/100000 + 1/100000000000 = 0.0000100000100000.

It is a Harshad number since it is a multiple of its sum of digits (2).

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

It is not an unprimeable number, because it can be changed into a prime (100000100009) 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 in 23 ways as a sum of consecutive naturals, for example, 10095050 + ... + 10104950.

Almost surely, 2100000100000 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 100000100000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (124269882156).

100000100000 is an abundant number, since it is smaller than the sum of its proper divisors (148539664312).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

100000100000 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 1, while the sum is 2.

Adding to 100000100000 its reverse (1000001), we get a palindrome (100001100001).

Subtracting from 100000100000 its reverse (1000001), we obtain a palindrome (99999099999).

100000100000 divided by its reverse (1000001) gives a 5-th power (100000 = 105).

The spelling of 100000100000 in words is "one hundred billion, one hundred thousand".

Divisors: 1 2 4 5 8 10 16 20 25 32 40 50 80 100 101 125 160 200 202 250 400 404 500 505 625 800 808 1000 1010 1250 1616 2000 2020 2500 2525 3125 3232 4000 4040 5000 5050 6250 8080 9901 10000 10100 12500 12625 16160 19802 20000 20200 25000 25250 39604 40400 49505 50000 50500 63125 79208 80800 99010 100000 101000 126250 158416 198020 202000 247525 252500 315625 316832 396040 404000 495050 505000 631250 792080 990100 1000001 1010000 1237625 1262500 1584160 1980200 2000002 2020000 2475250 2525000 3960400 4000004 4950500 5000005 5050000 6188125 7920800 8000008 9901000 10000010 10100000 12376250 16000016 19802000 20000020 24752500 25000025 30940625 32000032 39604000 40000040 49505000 50000050 61881250 80000080 99010000 100000100 123762500 125000125 160000160 198020000 200000200 247525000 250000250 400000400 495050000 500000500 625000625 800000800 990100000 1000001000 1250001250 2000002000 2500002500 3125003125 4000004000 5000005000 6250006250 10000010000 12500012500 20000020000 25000025000 50000050000 100000100000