Search a number
-
+
110011100101001 = 1110001009100091
BaseRepresentation
bin11001000000110111110100…
…100010101111100110001001
3112102111221212201100100002222
4121000313310202233212021
5103404410213111213001
61025550222433303425
732113016421025211
oct3100676442574611
9472457781310088
10110011100101001
113206449a029390
1210408a7aa04b75
134950004b76568
141d247cc22b241
15cab993e7661b
hex640df48af989

110011100101001 has 4 divisors (see below), whose sum is σ = 120012109201104. Its totient is φ = 100010091000900.

The previous prime is 110011100100977. The next prime is 110011100101027. The reversal of 110011100101001 is 100101001110011.

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 110011100101001 - 210 = 110011100099977 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 110011100101001.

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

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

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

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

Almost surely, 2110011100101001 is an apocalyptic number.

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

It is an amenable number.

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

110011100101001 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 10001009100102.

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

Adding to 110011100101001 its reverse (100101001110011), we get a palindrome (210112101211012).

It can be divided in two parts, 110011 and 100101001, that multiplied together give a palindrome (11012211221011).

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

Divisors: 1 11 10001009100091 110011100101001