Search a number
-
+
110130331310 = 2511013033131
BaseRepresentation
bin110011010010001000…
…1110111111010101110
3101112021011122111022122
41212210101313322232
53301021331100220
6122332043112542
710646063241056
oct1464421677256
9345234574278
10110130331310
1142784778a3a
1219416512752
13a50150041c
14548a62c566
152ce878e425
hex19a4477eae

110130331310 has 8 divisors (see below), whose sum is σ = 198234596376. Its totient is φ = 44052132520.

The previous prime is 110130331309. The next prime is 110130331327. The reversal of 110130331310 is 13133031011.

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

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

It is a Curzon number.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5506516556 + ... + 5506516575.

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

Almost surely, 2110130331310 is an apocalyptic number.

110130331310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 11013033138.

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

Adding to 110130331310 its reverse (13133031011), we get a palindrome (123263362321).

The spelling of 110130331310 in words is "one hundred ten billion, one hundred thirty million, three hundred thirty-one thousand, three hundred ten".

Divisors: 1 2 5 10 11013033131 22026066262 55065165655 110130331310