Search a number
-
+
1101111401102 = 21237445073323
BaseRepresentation
bin10000000001011111010…
…110101001101010001110
310220021011100100210102112
4100001133112221222032
5121020034004313402
62201502114424022
7142360365323666
oct20013726515216
93807140323375
101101111401102
11394a847530a9
1215949bb92012
137cab011b46b
143b418d331a6
151d998339e52
hex1005f5a9a8e

1101111401102 has 8 divisors (see below), whose sum is σ = 1653002325336. Its totient is φ = 550110625992.

The previous prime is 1101111401101. The next prime is 1101111401107. The reversal of 1101111401102 is 2011041111011.

It is a happy number.

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

It is a congruent number.

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

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

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

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

Almost surely, 21101111401102 is an apocalyptic number.

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

1101111401102 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 445074562.

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

Adding to 1101111401102 its reverse (2011041111011), we get a palindrome (3112152512113).

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

Divisors: 1 2 1237 2474 445073323 890146646 550555700551 1101111401102