Search a number
-
+
100110110100 = 2235271113333367
BaseRepresentation
bin101110100111100000…
…1110000110110010100
3100120101211211111220120
41131033001300312110
53120011142010400
6113553455031540
710142551616130
oct1351701606624
9316354744816
10100110110100
1139502602490
121749a80b5b0
139595582c50
144bb99243c0
15290dc39ca0
hex174f070d94

100110110100 has 288 divisors, whose sum is σ = 388904441856. Its totient is φ = 19201881600.

The previous prime is 100110110099. The next prime is 100110110101. The reversal of 100110110100 is 1011011001.

It is an interprime number because it is at equal distance from previous prime (100110110099) and next prime (100110110101).

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

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

It is a congruent number.

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

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 133617 + ... + 466983.

Almost surely, 2100110110100 is an apocalyptic number.

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

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

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

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

100110110100 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 100110110100 its reverse (1011011001), we get a palindrome (101121121101).

Subtracting from 100110110100 its reverse (1011011001), we obtain a palindrome (99099099099).

It can be divided in two parts, 1001 and 10110100, that added together give a palindrome (10111101).

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