Search a number
-
+
110110012101999 = 327133759919073181
BaseRepresentation
bin11001000010010011111100…
…001010000101010101101111
3112102212102012001201121022100
4121002103330022011111233
5103413020301044230444
61030103501412550143
732123120514123030
oct3102237412052557
9472772161647270
10110110012101999
11320a24372a6758
1210424084322353
1349594391478c0
141d294d2994a87
15cae3328eae69
hex6424fc28556f

110110012101999 has 192 divisors, whose sum is σ = 201546271180800. Its totient is φ = 56368625863680.

The previous prime is 110110012101961. The next prime is 110110012102007. The reversal of 110110012101999 is 999101210011011.

It is not a de Polignac number, because 110110012101999 - 27 = 110110012101871 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110110012101959) by changing a digit.

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

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

Almost surely, 2110110012101999 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5750 (or 5747 counting only the distinct ones).

The product of its (nonzero) digits is 1458, while the sum is 36.

It can be divided in two parts, 110110012 and 101999, that added together give a palindrome (110212011).

The spelling of 110110012101999 in words is "one hundred ten trillion, one hundred ten billion, twelve million, one hundred one thousand, nine hundred ninety-nine".