Base | Representation |
---|---|
bin | 11001100010110011110111… |
… | …010001101110010001010101 |
3 | 112201202220201122202211102212 |
4 | 121202303313101232101111 |
5 | 104211113101140300001 |
6 | 1034533450002243205 |
7 | 32443352013262610 |
oct | 3142636721562125 |
9 | 481686648684385 |
10 | 112343313212501 |
11 | 32883593584968 |
12 | 10724a78356505 |
13 | 4a8bc0cc73b47 |
14 | 1da5634159177 |
15 | cec4926987bb |
hex | 662cf746e455 |
112343313212501 has 8 divisors (see below), whose sum is σ = 131523878883264. Its totient is φ = 93945627773280.
The previous prime is 112343313212497. The next prime is 112343313212503. The reversal of 112343313212501 is 105212313343211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112343313212501 - 22 = 112343313212497 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112343313212503) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 195720057575 + ... + 195720058148.
It is an arithmetic number, because the mean of its divisors is an integer number (16440484860408).
Almost surely, 2112343313212501 is an apocalyptic number.
It is an amenable number.
112343313212501 is a deficient number, since it is larger than the sum of its proper divisors (19180565670763).
112343313212501 is an equidigital number, since it uses as much as digits as its factorization.
112343313212501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391440115771.
The product of its (nonzero) digits is 12960, while the sum is 32.
Adding to 112343313212501 its reverse (105212313343211), we get a palindrome (217555626555712).
The spelling of 112343313212501 in words is "one hundred twelve trillion, three hundred forty-three billion, three hundred thirteen million, two hundred twelve thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •