Search a number
-
+
110130112010 = 2511013011201
BaseRepresentation
bin110011010010001000…
…1000010011000001010
3101112021011020100111102
41212210101002120022
53301021302041020
6122332034301402
710646061335522
oct1464421023012
9345234210442
10110130112010
11427846391a6
1219416427862
13a501454669
14548a5b2682
152ce8749475
hex19a444260a

110130112010 has 8 divisors (see below), whose sum is σ = 198234201636. Its totient is φ = 44052044800.

The previous prime is 110130112007. The next prime is 110130112033. The reversal of 110130112010 is 10211031011.

It is a happy number.

It can be written as a sum of positive squares in 2 ways, for example, as 99971689489 + 10158422521 = 316183^2 + 100789^2 .

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

It is a junction number, because it is equal to n+sod(n) for n = 110130111982 and 110130112000.

It is an unprimeable number.

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

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

Almost surely, 2110130112010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 11013011208.

The product of its (nonzero) digits is 6, while the sum is 11.

Adding to 110130112010 its reverse (10211031011), we get a palindrome (120341143021).

The spelling of 110130112010 in words is "one hundred ten billion, one hundred thirty million, one hundred twelve thousand, ten".

Divisors: 1 2 5 10 11013011201 22026022402 55065056005 110130112010