Base | Representation |
---|---|
bin | 11001011111010001010110… |
… | …101000111111001111111001 |
3 | 112200220122221201020001122000 |
4 | 121133101112220333033321 |
5 | 104143122001100323001 |
6 | 1034230024111251213 |
7 | 32416651660212444 |
oct | 3137212650771771 |
9 | 480818851201560 |
10 | 112100100011001 |
11 | 3279a4270158a3 |
12 | 106a5900819b09 |
13 | 4a71cbcc90a6b |
14 | 1d97960c4665b |
15 | ce5eaa5d2a86 |
hex | 65f456a3f3f9 |
112100100011001 has 16 divisors (see below), whose sum is σ = 166145224564800. Its totient is φ = 74701448960544.
The previous prime is 112100100010999. The next prime is 112100100011021. The reversal of 112100100011001 is 100110001001211.
It is not a de Polignac number, because 112100100011001 - 21 = 112100100010999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (112100100011021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 887464756 + ... + 887591061.
It is an arithmetic number, because the mean of its divisors is an integer number (10384076535300).
Almost surely, 2112100100011001 is an apocalyptic number.
It is an amenable number.
112100100011001 is a deficient number, since it is larger than the sum of its proper divisors (54045124553799).
112100100011001 is a wasteful number, since it uses less digits than its factorization.
112100100011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1775058165 (or 1775058159 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 112100100011001 its reverse (100110001001211), we get a palindrome (212210101012212).
The spelling of 112100100011001 in words is "one hundred twelve trillion, one hundred billion, one hundred million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •