Search a number
-
+
100010011111 = 672081717293
BaseRepresentation
bin101110100100100001…
…1111010100111100111
3100120010212110221220121
41131021003322213213
53114310030323421
6113535521342411
710140225032263
oct1351103724747
9316125427817
10100010011111
113946105364a
1217471197a07
13957a90638a
144baa5090a3
152905065d41
hex17490fa9e7

100010011111 has 8 divisors (see below), whose sum is σ = 101551615344. Its totient is φ = 98469845760.

The previous prime is 100010011063. The next prime is 100010011133. The reversal of 100010011111 is 111110010001.

It is a happy number.

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

It is a cyclic number.

It is not a de Polignac number, because 100010011111 - 27 = 100010010983 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 100010011094 and 100010011103.

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 219220 + ... + 498073.

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

Almost surely, 2100010011111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 719441.

The product of its (nonzero) digits is 1, while the sum is 7.

Adding to 100010011111 its reverse (111110010001), we get a palindrome (211120021112).

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

Divisors: 1 67 2081 139427 717293 48058631 1492686733 100010011111