Search a number
-
+
100091001001 = 523191378587
BaseRepresentation
bin101110100110111100…
…0110111100010101001
3100120100111212200011011
41131031320313202221
53114441244013001
6113551533303521
710142230320355
oct1351570674251
9316314780134
10100091001001
11394a2840542
1217494334ba1
1395916221a4
144bb718c465
15290c212d51
hex174de378a9

100091001001 has 4 divisors (see below), whose sum is σ = 100282380112. Its totient is φ = 99899621892.

The previous prime is 100091000987. The next prime is 100091001011. The reversal of 100091001001 is 100100190001.

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 100091001001 - 25 = 100091000969 is a prime.

It is a Duffinian number.

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

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

Almost surely, 2100091001001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 191379110.

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

Adding to 100091001001 its reverse (100100190001), we get a palindrome (200191191002).

The spelling of 100091001001 in words is "one hundred billion, ninety-one million, one thousand, one".

Divisors: 1 523 191378587 100091001001