Base | Representation |
---|---|
bin | 110100001100110110… |
… | …0011111011101100101 |
3 | 101201100110101101120000 |
4 | 1220121230133131211 |
5 | 3314040130241201 |
6 | 123255333131513 |
7 | 11045643226524 |
oct | 1503154373545 |
9 | 351313341500 |
10 | 112100243301 |
11 | 435a5734a82 |
12 | 19886189b99 |
13 | a756671717 |
14 | 55d60d44bb |
15 | 2db16abd86 |
hex | 1a19b1f765 |
112100243301 has 20 divisors (see below), whose sum is σ = 168080942700. Its totient is φ = 74455661376.
The previous prime is 112100243261. The next prime is 112100243377. The reversal of 112100243301 is 103342001211.
112100243301 is a `hidden beast` number, since 1 + 121 + 0 + 0 + 243 + 301 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 43744140801 + 68356102500 = 209151^2 + 261450^2 .
It is not a de Polignac number, because 112100243301 - 219 = 112099719013 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112100243701) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 2550616 + ... + 2594193.
It is an arithmetic number, because the mean of its divisors is an integer number (8404047135).
Almost surely, 2112100243301 is an apocalyptic number.
It is an amenable number.
112100243301 is a deficient number, since it is larger than the sum of its proper divisors (55980699399).
112100243301 is an equidigital number, since it uses as much as digits as its factorization.
112100243301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5145090 (or 5145081 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 112100243301 its reverse (103342001211), we get a palindrome (215442244512).
The spelling of 112100243301 in words is "one hundred twelve billion, one hundred million, two hundred forty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •