Search a number
-
+
100110111111002 = 250055055555501
BaseRepresentation
bin10110110000110010110011…
…100111000111011101011010
3111010110102200202210112022002
4112300302303213013131122
5101110201001421023002
6552525541122001002
730041500610142416
oct2660626347073532
9433412622715262
10100110111111002
1129997506947663
12b28a0157a6162
1343b245c676ab5
141aa14d8a79d46
15b89161514002
hex5b0cb39c775a

100110111111002 has 4 divisors (see below), whose sum is σ = 150165166666506. Its totient is φ = 50055055555500.

The previous prime is 100110111110987. The next prime is 100110111111007. The reversal of 100110111111002 is 200111111011001.

It is a happy number.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in only one way, i.e., 99959024198401 + 151086912601 = 9997951^2 + 388699^2 .

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25027527777749 + ... + 25027527777752.

Almost surely, 2100110111111002 is an apocalyptic number.

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

100110111111002 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 50055055555503.

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

Adding to 100110111111002 its reverse (200111111011001), we get a palindrome (300221222122003).

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

Divisors: 1 2 50055055555501 100110111111002