Search a number
-
+
110101010000002 = 2766851117640093
BaseRepresentation
bin11001000010001011100011…
…100101110010100010000010
3112102211112221200200102220021
4121002023203211302202002
5103412343332030000002
61030055412234404054
732122351444405510
oct3102134345624202
9472745850612807
10110101010000002
11320996378aa23a
121042239159062a
13495863310c928
141d28cbb1934b0
15cadea7456737
hex6422e3972882

110101010000002 has 16 divisors (see below), whose sum is σ = 188747413538112. Its totient is φ = 47185440901200.

The previous prime is 110101009999999. The next prime is 110101010000071. The reversal of 110101010000002 is 200000010101011.

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

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57884133 + ... + 59755960.

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

Almost surely, 2110101010000002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 117706953.

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

Adding to 110101010000002 its reverse (200000010101011), we get a palindrome (310101020101013).

The spelling of 110101010000002 in words is "one hundred ten trillion, one hundred one billion, ten million, two", and thus it is an aban number.

Divisors: 1 2 7 14 66851 133702 467957 935914 117640093 235280186 823480651 1646961302 7864357857143 15728715714286 55050505000001 110101010000002