Base | Representation |
---|---|
bin | 11001011111011010101011… |
… | …010010000110111001111001 |
3 | 112200221121210022210202011202 |
4 | 121133122223102012321321 |
5 | 104143303001130323001 |
6 | 1034234401252303545 |
7 | 32420455015624064 |
oct | 3137325322067171 |
9 | 480847708722152 |
10 | 112110110011001 |
11 | 327a36a343aa73 |
12 | 106a7835011bb5 |
13 | 4a72c26a6ca9b |
14 | 1d9823044d8db |
15 | ce63942b896b |
hex | 65f6ab486e79 |
112110110011001 has 4 divisors (see below), whose sum is σ = 112130798355600. Its totient is φ = 112089421666404.
The previous prime is 112110110010931. The next prime is 112110110011007. The reversal of 112110110011001 is 100110011011211.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 112110110011001 - 246 = 41741365833337 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112110110011007) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10344164171 + ... + 10344175008.
It is an arithmetic number, because the mean of its divisors is an integer number (28032699588900).
Almost surely, 2112110110011001 is an apocalyptic number.
It is an amenable number.
112110110011001 is a deficient number, since it is larger than the sum of its proper divisors (20688344599).
112110110011001 is an equidigital number, since it uses as much as digits as its factorization.
112110110011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20688344598.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 112110110011001 its reverse (100110011011211), we get a palindrome (212220121022212).
The spelling of 112110110011001 in words is "one hundred twelve trillion, one hundred ten billion, one hundred ten million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •