Base | Representation |
---|---|
bin | 110100001101001001… |
… | …1010001110110001001 |
3 | 101201101011111222012211 |
4 | 1220122103101312021 |
5 | 3314100231124040 |
6 | 123300335105121 |
7 | 11046125525425 |
oct | 1503223216611 |
9 | 351334458184 |
10 | 112110411145 |
11 | 4360044a257 |
12 | 198896721a1 |
13 | a7587c17b5 |
14 | 55d75bdb85 |
15 | 2db25198ea |
hex | 1a1a4d1d89 |
112110411145 has 8 divisors (see below), whose sum is σ = 141613151040. Its totient is φ = 84967890480.
The previous prime is 112110411143. The next prime is 112110411157. The reversal of 112110411145 is 541114011211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112110411145 - 21 = 112110411143 is a prime.
It is a super-2 number, since 2×1121104111452 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112110411143) by changing a digit.
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, 590054701 + ... + 590054890.
It is an arithmetic number, because the mean of its divisors is an integer number (17701643880).
Almost surely, 2112110411145 is an apocalyptic number.
It is an amenable number.
112110411145 is a deficient number, since it is larger than the sum of its proper divisors (29502739895).
112110411145 is a wasteful number, since it uses less digits than its factorization.
112110411145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1180109615.
The product of its (nonzero) digits is 160, while the sum is 22.
Adding to 112110411145 its reverse (541114011211), we get a palindrome (653224422356).
The spelling of 112110411145 in words is "one hundred twelve billion, one hundred ten million, four hundred eleven thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •