Search a number
-
+
110111201022002 = 255055600511001
BaseRepresentation
bin11001000010010101000011…
…000001011101000000110010
3112102212112020220212222221112
4121002111003001131000302
5103413030214430201002
61030104215403353322
732123162131563065
oct3102250301350062
9472775226788845
10110111201022002
11320a2997424974
1210424356522842
13495959855ca6b
141d295a683c8dc
15cae3a1e98852
hex64254305d032

110111201022002 has 4 divisors (see below), whose sum is σ = 165166801533006. Its totient is φ = 55055600511000.

The previous prime is 110111201021929. The next prime is 110111201022013. The reversal of 110111201022002 is 200220102111011.

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., 62130795171481 + 47980405850521 = 7882309^2 + 6926789^2 .

It is an unprimeable number.

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

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

Almost surely, 2110111201022002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 55055600511003.

The product of its (nonzero) digits is 16, while the sum is 14.

Adding to 110111201022002 its reverse (200220102111011), we get a palindrome (310331303133013).

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

Divisors: 1 2 55055600511001 110111201022002