Base | Representation |
---|---|
bin | 110100001101011100… |
… | …1000111101110111001 |
3 | 101201101212011221222000 |
4 | 1220122321013232321 |
5 | 3314110301044233 |
6 | 123301331451213 |
7 | 11046306043023 |
oct | 1503271075671 |
9 | 351355157860 |
10 | 112120331193 |
11 | 43606005342 |
12 | 19890a56b09 |
13 | a75a885b50 |
14 | 55d8a43013 |
15 | 2db3328d13 |
hex | 1a1ae47bb9 |
112120331193 has 96 divisors (see below), whose sum is σ = 188060745600. Its totient is φ = 65612042496.
The previous prime is 112120331179. The next prime is 112120331201. The reversal of 112120331193 is 391133021211.
112120331193 is a `hidden beast` number, since 1 + 121 + 20 + 331 + 193 = 666.
It is not a de Polignac number, because 112120331193 - 213 = 112120323001 is a prime.
It is a super-3 number, since 3×1121203311933 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (112120331173) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 19774963 + ... + 19780631.
It is an arithmetic number, because the mean of its divisors is an integer number (1958966100).
Almost surely, 2112120331193 is an apocalyptic number.
112120331193 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
112120331193 is a deficient number, since it is larger than the sum of its proper divisors (75940414407).
112120331193 is a wasteful number, since it uses less digits than its factorization.
112120331193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5816 (or 5781 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 27.
The spelling of 112120331193 in words is "one hundred twelve billion, one hundred twenty million, three hundred thirty-one thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •