Search a number
-
+
100010311111 = 997310028107
BaseRepresentation
bin101110100100100010…
…1000011110111000111
3100120010220001012102201
41131021011003313013
53114310114423421
6113535532015331
710140230422024
oct1351105036707
9316126035381
10100010311111
1139461238a87
1217471301547
13957a9acaa9
144baa58654b
1529050c4b91
hex1749143dc7

100010311111 has 4 divisors (see below), whose sum is σ = 100020349192. Its totient is φ = 100000273032.

The previous prime is 100010311103. The next prime is 100010311123. The reversal of 100010311111 is 111113010001.

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 100010311111 - 23 = 100010311103 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 (100010321111) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2100010311111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 10038080.

The product of its (nonzero) digits is 3, while the sum is 10.

Adding to 100010311111 its reverse (111113010001), we get a palindrome (211123321112).

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

Divisors: 1 9973 10028107 100010311111