Search a number
-
+
110503931982 = 2318417321997
BaseRepresentation
bin110011011101010001…
…1000011000001001110
3101120020012122101002120
41212322203003001032
53302303001310412
6122433110433410
710661250631623
oct1467243030116
9346205571076
10110503931982
1142956652724
12194bb662866
13a560a2a902
1454c40c034a
152d1b48ab8c
hex19ba8c304e

110503931982 has 8 divisors (see below), whose sum is σ = 221007863976. Its totient is φ = 36834643992.

The previous prime is 110503931933. The next prime is 110503932017. The reversal of 110503931982 is 289139305011.

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

110503931982 is an admirable number.

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

It is a congruent number.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 9208660993 + ... + 9208661004.

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

Almost surely, 2110503931982 is an apocalyptic number.

110503931982 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 18417322002.

The product of its (nonzero) digits is 58320, while the sum is 42.

The spelling of 110503931982 in words is "one hundred ten billion, five hundred three million, nine hundred thirty-one thousand, nine hundred eighty-two".

Divisors: 1 2 3 6 18417321997 36834643994 55251965991 110503931982