Search a number
-
+
110110010101 = 7131210000111
BaseRepresentation
bin110011010001100010…
…0010110101011110101
3101112012202102001212021
41212203010112223311
53301001130310401
6122330035353141
710645425433420
oct1464304265365
9345182361767
10110110010101
1142774259353
121940b7527b1
13a4ca236a40
145487a5c9b7
152ce6ac82a1
hex19a3116af5

110110010101 has 8 divisors (see below), whose sum is σ = 135520012544. Its totient is φ = 87120007920.

The previous prime is 110110010099. The next prime is 110110010149. The reversal of 110110010101 is 101010011011.

It is a happy number.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 110110010101 - 21 = 110110010099 is a prime.

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

It is a congruent number.

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

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, 604999965 + ... + 605000146.

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

Almost surely, 2110110010101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1210000131.

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

Adding to 110110010101 its reverse (101010011011), we get a palindrome (211120021112).

The spelling of 110110010101 in words is "one hundred ten billion, one hundred ten million, ten thousand, one hundred one".

Divisors: 1 7 13 91 1210000111 8470000777 15730001443 110110010101