Search a number
-
+
100000211110 = 2510000021111
BaseRepresentation
bin101110100100001111…
…0100010000010100110
3100120010012001001211121
41131020132202002212
53114300023223420
6113534531324154
710140045524662
oct1351036420246
9316105031747
10100000211110
113945656a778
1217469a5065a
139578884867
144ba90b78a2
15290427c2aa
hex17487a20a6

100000211110 has 8 divisors (see below), whose sum is σ = 180000380016. Its totient is φ = 40000084440.

The previous prime is 100000211083. The next prime is 100000211111. The reversal of 100000211110 is 11112000001.

It is a sphenic number, since it is the product of 3 distinct primes.

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

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5000010546 + ... + 5000010565.

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

Almost surely, 2100000211110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 10000021118.

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

Adding to 100000211110 its reverse (11112000001), we get a palindrome (111112211111).

The spelling of 100000211110 in words is "one hundred billion, two hundred eleven thousand, one hundred ten".

Divisors: 1 2 5 10 10000021111 20000042222 50000105555 100000211110