Search a number
-
+
110010110131982 = 2471170320320553
BaseRepresentation
bin11001000000110110111001…
…100010010011111100001110
3112102111212022201112200220202
4121000312321202103330032
5103404401201143210412
61025545540311013502
732112653040313154
oct3100667142237416
9472455281480822
10110010110131982
1132064031236a75
121040884336a292
13494cba7a3c088
141d247369713d4
15cab9370c73c2
hex640db9893f0e

110010110131982 has 8 divisors (see below), whose sum is σ = 168526126159776. Its totient is φ = 53834734745392.

The previous prime is 110010110131969. The next prime is 110010110132011. The reversal of 110010110131982 is 289131011010011.

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

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 2110010110131982 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1170320320602.

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

Adding to 110010110131982 its reverse (289131011010011), we get a palindrome (399141121141993).

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

Divisors: 1 2 47 94 1170320320553 2340640641106 55005055065991 110010110131982