Search a number
-
+
100100010101000 = 235372134127114143
BaseRepresentation
bin10110110000101001011001…
…100010110100100100001000
3111010102110121210222001111112
4112300221121202310210020
5101110014310041213000
6552521150530145452
730040662365030600
oct2660513142644410
9433373553861445
10100100010101000
11299931a3111308
12b288076a22288
1343b150ca811c0
141aa0c1b341c00
15b88c6e852235
hex5b0a598b4908

100100010101000 has 768 divisors, whose sum is σ = 301723537489920. Its totient is φ = 30791093760000.

The previous prime is 100100010100933. The next prime is 100100010101009. The reversal of 100100010101000 is 101010001001.

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

It is not an unprimeable number, because it can be changed into a prime (100100010101009) by changing a digit.

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 191 ways as a sum of consecutive naturals, for example, 7077699929 + ... + 7077714071.

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

Almost surely, 2100100010101000 is an apocalyptic number.

100100010101000 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 100100010101000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150861768744960).

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

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

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

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

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

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

Adding to 100100010101000 its reverse (101010001001), we get a palindrome (100201020102001).

Subtracting from 100100010101000 its reverse (101010001001), we obtain a palindrome (99999000099999).

The spelling of 100100010101000 in words is "one hundred trillion, one hundred billion, ten million, one hundred one thousand".