Base | Representation |
---|---|
bin | 110100001011000100… |
… | …0110000101101101101 |
3 | 101201012022001102001202 |
4 | 1220112020300231231 |
5 | 3313424334421013 |
6 | 123245401415245 |
7 | 11044316630426 |
oct | 1502610605555 |
9 | 351168042052 |
10 | 112040545133 |
11 | 43574a6a950 |
12 | 1986a19a525 |
13 | a74719bc6a |
14 | 55cc1d464d |
15 | 2dab318858 |
hex | 1a16230b6d |
112040545133 has 8 divisors (see below), whose sum is σ = 122233215456. Its totient is φ = 101849069200.
The previous prime is 112040545129. The next prime is 112040545187. The reversal of 112040545133 is 331545040211.
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 112040545133 - 22 = 112040545129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112040545096 and 112040545105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112040575133) 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, 96503 + ... + 483108.
It is an arithmetic number, because the mean of its divisors is an integer number (15279151932).
Almost surely, 2112040545133 is an apocalyptic number.
It is an amenable number.
112040545133 is a deficient number, since it is larger than the sum of its proper divisors (10192670323).
112040545133 is a wasteful number, since it uses less digits than its factorization.
112040545133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 597195.
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 112040545133 its reverse (331545040211), we get a palindrome (443585585344).
The spelling of 112040545133 in words is "one hundred twelve billion, forty million, five hundred forty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •