Search a number
-
+
10001112110110 = 251190919201001
BaseRepresentation
bin1001000110001001000010…
…1111000001010000011110
31022102002121200212022002201
42101202100233001100132
52302324234200010420
633134240353242114
72051361611205652
oct221422057012036
938362550768081
1010001112110110
1132064a206a890
12115634826333a
13577140689344
142680b0b00a62
151252428bc10a
hex91890bc141e

10001112110110 has 16 divisors (see below), whose sum is σ = 19638547416432. Its totient is φ = 3636768040000.

The previous prime is 10001112110027. The next prime is 10001112110147. The reversal of 10001112110110 is 1101121110001.

It is a Harshad number since it is a multiple of its sum of digits (10).

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

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

Almost surely, 210001112110110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 90919201019.

The product of its (nonzero) digits is 2, while the sum is 10.

Adding to 10001112110110 its reverse (1101121110001), we get a palindrome (11102233220111).

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

Divisors: 1 2 5 10 11 22 55 110 90919201001 181838402002 454596005005 909192010010 1000111211011 2000222422022 5000556055055 10001112110110