Search a number
-
+
109011001001 = 715573000143
BaseRepresentation
bin110010110000110001…
…1111101111010101001
3101102101011102121210112
41211201203331322221
53241223304013001
6122025020024105
710606252135310
oct1454143757251
9342334377715
10109011001001
114225a960571
1219163692035
13a3836420b6
1453c1adb277
152c8038acbb
hex19618fdea9

109011001001 has 4 divisors (see below), whose sum is σ = 124584001152. Its totient is φ = 93438000852.

The previous prime is 109011000949. The next prime is 109011001019. The reversal of 109011001001 is 100100110901.

It is a happy number.

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 not a de Polignac number, because 109011001001 - 26 = 109011000937 is a prime.

It is a Duffinian number.

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

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

Almost surely, 2109011001001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 15573000150.

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

Adding to 109011001001 its reverse (100100110901), we get a palindrome (209111111902).

It can be divided in two parts, 10901 and 1001001, that multiplied together give a palindrome (10911911901).

The spelling of 109011001001 in words is "one hundred nine billion, eleven million, one thousand, one".

Divisors: 1 7 15573000143 109011001001