Search a number
-
+
110121002111102 = 255060501055551
BaseRepresentation
bin11001000010011110001011…
…001101101001000001111110
3112102220110112222100220121112
4121002132023031221001332
5103413210303020023402
61030112520123002022
732123660042504633
oct3102361315510176
9472813488326545
10110121002111102
11320a7066930204
1210426230969312
13495a49ac84878
141d29c563c418a
15cae777664e52
hex64278b36907e

110121002111102 has 4 divisors (see below), whose sum is σ = 165181503166656. Its totient is φ = 55060501055550.

The previous prime is 110121002111083. The next prime is 110121002111117. The reversal of 110121002111102 is 201111200121011.

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

It is a super-2 number, since 2×1101210021111022 (a number of 29 digits) contains 22 as substring.

It is a congruent number.

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, 27530250527774 + ... + 27530250527777.

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

Almost surely, 2110121002111102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 55060501055553.

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

Adding to 110121002111102 its reverse (201111200121011), we get a palindrome (311232202232113).

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

Divisors: 1 2 55060501055551 110121002111102