Search a number
-
+
1101111030103 = 7157301575729
BaseRepresentation
bin10000000001011111010…
…101001111000101010111
310220021011022122221111211
4100001133111033011113
5121020033410430403
62201502102442251
7142360362220240
oct20013725170527
93807138587454
101101111030103
11394a8451a397
1215949ba33387
137cab001b636
143b418c77cc7
151d9982b506d
hex1005f54f157

1101111030103 has 4 divisors (see below), whose sum is σ = 1258412605840. Its totient is φ = 943809454368.

The previous prime is 1101111030101. The next prime is 1101111030121. The reversal of 1101111030103 is 3010301111011.

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

It is a cyclic number.

It is not a de Polignac number, because 1101111030103 - 21 = 1101111030101 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1101111030101) 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, 78650787858 + ... + 78650787871.

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

Almost surely, 21101111030103 is an apocalyptic number.

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

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

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

The sum of its prime factors is 157301575736.

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

Adding to 1101111030103 its reverse (3010301111011), we get a palindrome (4111412141114).

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

Divisors: 1 7 157301575729 1101111030103