Base | Representation |
---|---|
bin | 11001011110010001000110… |
… | …101101001100001000000101 |
3 | 112200200001212220100221221211 |
4 | 121132101012231030020011 |
5 | 104141004204434401013 |
6 | 1034134214412411421 |
7 | 32411660265045121 |
oct | 3136210655141005 |
9 | 480601786327854 |
10 | 112031113200133 |
11 | 32773145835816 |
12 | 10694469176b71 |
13 | 4a6864772090a |
14 | 1d94498a12581 |
15 | ce42bde0b23d |
hex | 65e446b4c205 |
112031113200133 has 32 divisors (see below), whose sum is σ = 115431118572672. Its totient is φ = 108664928870400.
The previous prime is 112031113200121. The next prime is 112031113200197. The reversal of 112031113200133 is 331002311130211.
It is a cyclic number.
It is not a de Polignac number, because 112031113200133 - 217 = 112031113069061 is a prime.
It is a super-2 number, since 2×1120311132001332 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112031113200233) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11008259941 + ... + 11008270117.
It is an arithmetic number, because the mean of its divisors is an integer number (3607222455396).
Almost surely, 2112031113200133 is an apocalyptic number.
It is an amenable number.
112031113200133 is a deficient number, since it is larger than the sum of its proper divisors (3400005372539).
112031113200133 is a wasteful number, since it uses less digits than its factorization.
112031113200133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12565.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 112031113200133 its reverse (331002311130211), we get a palindrome (443033424330344).
The spelling of 112031113200133 in words is "one hundred twelve trillion, thirty-one billion, one hundred thirteen million, two hundred thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •