Search a number
-
+
110020111100001 = 3291913301911631
BaseRepresentation
bin11001000001000000001101…
…101000111110100001100001
3112102112211010201010111220200
4121001000031220332201201
5103410032141420200001
61025554312530255413
732113455626166264
oct3101001550764141
9472484121114820
10110020111100001
11320682a35522a3
121040a774727569
134950b0c9a802b
141d25004ca6cdb
15cabd200c7086
hex64100da3e861

110020111100001 has 12 divisors (see below), whose sum is σ = 159090863118720. Its totient is φ = 73266929258040.

The previous prime is 110020111099963. The next prime is 110020111100063. The reversal of 110020111100001 is 100001111020011.

It is not a de Polignac number, because 110020111100001 - 213 = 110020111091809 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6650947545 + ... + 6650964086.

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

Almost surely, 2110020111100001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 13301912556 (or 13301912553 counting only the distinct ones).

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

Adding to 110020111100001 its reverse (100001111020011), we get a palindrome (210021222120012).

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

Divisors: 1 3 9 919 2757 8271 13301911631 39905734893 119717204679 12224456788889 36673370366667 110020111100001