Search a number
-
+
110101110051 = 3254314431919
BaseRepresentation
bin110011010001010001…
…0011001110100100011
3101112012010122220021210
41212202202121310203
53300441341010201
6122325120521203
710645256664642
oct1464242316443
9345163586253
10110101110051
114276a22a639
1219408780203
13a4c843ba3a
1454867c3359
152ce5e1b1d6
hex19a2899d23

110101110051 has 8 divisors (see below), whose sum is σ = 146859217920. Its totient is φ = 73371871112.

The previous prime is 110101110047. The next prime is 110101110121. The reversal of 110101110051 is 150011101011.

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 110101110051 - 22 = 110101110047 is a prime.

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

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

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

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

Almost surely, 2110101110051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 14434465.

The product of its (nonzero) digits is 5, while the sum is 12.

Adding to 110101110051 its reverse (150011101011), we get a palindrome (260112211062).

The spelling of 110101110051 in words is "one hundred ten billion, one hundred one million, one hundred ten thousand, fifty-one".

Divisors: 1 3 2543 7629 14431919 43295757 36700370017 110101110051