Search a number
-
+
110000001011102 = 2101544554460451
BaseRepresentation
bin11001000000101101011110…
…111111000100110110011110
3112102110220020012110011002022
4121000231132333010312132
5103404220000224323402
61025541145225300142
732112144366230426
oct3100553677046636
9472426205404068
10110000001011102
113205a813970914
12104068a1934652
13494bc56566747
141d24058125486
15cab5448622a2
hex640b5efc4d9e

110000001011102 has 8 divisors (see below), whose sum is σ = 166633664898312. Its totient is φ = 54455446045000.

The previous prime is 110000001011093. The next prime is 110000001011179. The reversal of 110000001011102 is 201110100000011.

It is a happy number.

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

It is a self number, because there is not a number n which added to its sum of digits gives 110000001011102.

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2110000001011102 is an apocalyptic number.

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

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

110000001011102 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 544554460554.

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

Adding to 110000001011102 its reverse (201110100000011), we get a palindrome (311110101011113).

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

Divisors: 1 2 101 202 544554460451 1089108920902 55000000505551 110000001011102