Search a number
-
+
110061055613 = 1512227732719
BaseRepresentation
bin110011010000000100…
…1100110111001111101
3101112002100021220221002
41212200021212321331
53300401112234423
6122321130220045
710644262352105
oct1464011467175
9345070256832
10110061055613
11427496620a3
12193b7284625
13a4c00564a2
145481358205
152ce2658228
hex19a0266e7d

110061055613 has 8 divisors (see below), whose sum is σ = 110798296320. Its totient is φ = 109323925200.

The previous prime is 110061055609. The next prime is 110061055627. The reversal of 110061055613 is 316550160011.

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 110061055613 - 22 = 110061055609 is a prime.

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

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 2110061055613 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 55147.

The product of its (nonzero) digits is 2700, while the sum is 29.

The spelling of 110061055613 in words is "one hundred ten billion, sixty-one million, fifty-five thousand, six hundred thirteen".

Divisors: 1 151 22277 32719 3363827 4940569 728881163 110061055613