Search a number
-
+
100001111100002 = 277142936507143
BaseRepresentation
bin10110101111001101010010…
…101101000100101001100010
3111010002000100101001020221122
4112233031102231010221202
5101101404233420200002
6552403513133252242
730030561520265660
oct2657152255045142
9433060311036848
10100001111100002
1129955262213042
12b270a75934082
1343a50ab3b2078
141a9a1185ddc30
15b863d20e96a2
hex5af352b44a62

100001111100002 has 8 divisors (see below), whose sum is σ = 171430476171456. Its totient is φ = 42857619042852.

The previous prime is 100001111099941. The next prime is 100001111100029. The reversal of 100001111100002 is 200001111100001.

It is a happy number.

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

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2100001111100002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 7142936507152.

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

Adding to 100001111100002 its reverse (200001111100001), we get a palindrome (300002222200003).

Subtracting 100001111100002 from its reverse (200001111100001), we obtain a palindrome (99999999999999).

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

Divisors: 1 2 7 14 7142936507143 14285873014286 50000555550001 100001111100002