Search a number
-
+
112001030110 = 2568897162563
BaseRepresentation
bin110100001001111001…
…0000001011111011110
3101201002112200211122101
41220103302001133132
53313334230430420
6123241430435314
711043330022324
oct1502362013736
9351075624571
10112001030110
1143554730702
1219858b02b3a
13a73bc450a8
1455c6c69d14
152da7b1060a
hex1a13c817de

112001030110 has 16 divisors (see below), whose sum is σ = 201606020496. Its totient is φ = 44799486208.

The previous prime is 112001030039. The next prime is 112001030137. The reversal of 112001030110 is 11030100211.

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

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 (19) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 607689 + ... + 770251.

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

Almost surely, 2112001030110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 231467.

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

Adding to 112001030110 its reverse (11030100211), we get a palindrome (123031130321).

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

Divisors: 1 2 5 10 68897 137794 162563 325126 344485 688970 812815 1625630 11200103011 22400206022 56000515055 112001030110