Search a number
-
+
100555060111 = 119141369101
BaseRepresentation
bin101110110100110001…
…1000111001110001111
3100121112212002022120121
41131221203013032033
53121414043410421
6114105551525411
710156563623362
oct1355143071617
9317485068517
10100555060111
1139710789a70
12175a3829867
13963680218c
144c1ca6a0d9
152937d2bd41
hex17698c738f

100555060111 has 4 divisors (see below), whose sum is σ = 109696429224. Its totient is φ = 91413691000.

The previous prime is 100555060093. The next prime is 100555060139. The reversal of 100555060111 is 111060555001.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 111060555001 = 1110096414091.

It is a cyclic number.

It is not a de Polignac number, because 100555060111 - 215 = 100555027343 is a prime.

It is a super-2 number, since 2×1005550601112 (a number of 23 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 (100555061111) 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, 4570684540 + ... + 4570684561.

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

Almost surely, 2100555060111 is an apocalyptic number.

100555060111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

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

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

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

The sum of its prime factors is 9141369112.

The product of its (nonzero) digits is 750, while the sum is 25.

The spelling of 100555060111 in words is "one hundred billion, five hundred fifty-five million, sixty thousand, one hundred eleven".

Divisors: 1 11 9141369101 100555060111