Search a number
-
+
110011020001 = 991111010111
BaseRepresentation
bin110011001110100101…
…0101111001011100001
3101111221212010211222021
41212131022233023201
53300300310120001
6122312141541441
710643114145511
oct1463512571341
9344855124867
10110011020001
1142723397653
12193a2574881
13a4b2887b0c
145478851841
152cdd072ba1
hex199d2af2e1

110011020001 has 4 divisors (see below), whose sum is σ = 110122031104. Its totient is φ = 109900008900.

The previous prime is 110011019999. The next prime is 110011020013. The reversal of 110011020001 is 100020110011.

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 110011020001 - 21 = 110011019999 is a prime.

It is a Duffinian number.

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

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

Almost surely, 2110011020001 is an apocalyptic number.

It is an amenable number.

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

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

110011020001 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 111011102.

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

Adding to 110011020001 its reverse (100020110011), we get a palindrome (210031130012).

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

Divisors: 1 991 111010111 110011020001