Search a number
-
+
111110120100002 = 255555060050001
BaseRepresentation
bin11001010000110111010111…
…001111010101000010100010
3112120102000122022100220012102
4121100313113033111002202
5104030412011221200002
61032151141242130402
732255304232625042
oct3120672717250242
9476360568326172
10111110120100002
11324485a01860a1
1210565a764b0a02
1349cc8408c748a
141d61a894b1722
15cca368896a02
hex650dd73d50a2

111110120100002 has 4 divisors (see below), whose sum is σ = 166665180150006. Its totient is φ = 55555060050000.

The previous prime is 111110120099983. The next prime is 111110120100037. The reversal of 111110120100002 is 200001021011111.

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., 110932102769761 + 178017330241 = 10532431^2 + 421921^2 .

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 as a sum of consecutive naturals, namely, 27777530024999 + ... + 27777530025002.

Almost surely, 2111110120100002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 55555060050003.

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

Adding to 111110120100002 its reverse (200001021011111), we get a palindrome (311111141111113).

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

Divisors: 1 2 55555060050001 111110120100002