Search a number
-
+
1103011310101 = 4711392341159
BaseRepresentation
bin10000000011010000100…
…110001110101000010101
310220110001202101011121111
4100003100212032220111
5121032431343410401
62202414424215021
7142455435304201
oct20032046165025
93813052334544
101103011310101
1139586a146928
1215993030a471
138002391c77c
143b5593b5b01
151da5a02ae51
hex100d098ea15

1103011310101 has 4 divisors (see below), whose sum is σ = 1103014122400. Its totient is φ = 1103008497804.

The previous prime is 1103011310099. The next prime is 1103011310111. The reversal of 1103011310101 is 1010131103011.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 1103011310101 - 21 = 1103011310099 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

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

Almost surely, 21103011310101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2812298.

The product of its (nonzero) digits is 9, while the sum is 13.

Adding to 1103011310101 its reverse (1010131103011), we get a palindrome (2113142413112).

The spelling of 1103011310101 in words is "one trillion, one hundred three billion, eleven million, three hundred ten thousand, one hundred one".

Divisors: 1 471139 2341159 1103011310101