Search a number
-
+
110061110051 = 361330462527
BaseRepresentation
bin110011010000000100…
…1110100001100100011
3101112002100101200121022
41212200021310030203
53300401121010201
6122321131320055
710644262666604
oct1464011641443
9345070350538
10110061110051
1142749699a92
12193b72b002b
13a4c00751b9
14548136ddab
152ce266941b
hex19a0274323

110061110051 has 4 divisors (see below), whose sum is σ = 110091576192. Its totient is φ = 110030643912.

The previous prime is 110061110041. The next prime is 110061110063. The reversal of 110061110051 is 150011160011.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 110061110051 - 26 = 110061109987 is a prime.

It is a super-2 number, since 2×1100611100512 (a number of 23 digits) contains 22 as substring.

It is a Duffinian number.

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

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

Almost surely, 2110061110051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 30466140.

The product of its (nonzero) digits is 30, while the sum is 17.

Adding to 110061110051 its reverse (150011160011), we get a palindrome (260072270062).

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

Divisors: 1 3613 30462527 110061110051