Base | Representation |
---|---|
bin | 11001100000001011000000… |
… | …100110011000101011000001 |
3 | 112201010120202010121221022110 |
4 | 121200023000212120223001 |
5 | 104200130242324140440 |
6 | 1034314303110325533 |
7 | 32424303046132446 |
oct | 3140130046305301 |
9 | 481116663557273 |
10 | 112162007255745 |
11 | 32813705047087 |
12 | 106b58b93598a9 |
13 | 4a77aa78ba225 |
14 | 1d9a954b2b9cd |
15 | ce78d04c5080 |
hex | 6602c0998ac1 |
112162007255745 has 32 divisors (see below), whose sum is σ = 179661416600448. Its totient is φ = 59752338743808.
The previous prime is 112162007255717. The next prime is 112162007255819. The reversal of 112162007255745 is 547552700261211.
It is not a de Polignac number, because 112162007255745 - 211 = 112162007253697 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 112162007255694 and 112162007255703.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 796325467 + ... + 796466303.
It is an arithmetic number, because the mean of its divisors is an integer number (5614419268764).
Almost surely, 2112162007255745 is an apocalyptic number.
112162007255745 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
112162007255745 is a deficient number, since it is larger than the sum of its proper divisors (67499409344703).
112162007255745 is a wasteful number, since it uses less digits than its factorization.
112162007255745 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200289.
The product of its (nonzero) digits is 1176000, while the sum is 48.
The spelling of 112162007255745 in words is "one hundred twelve trillion, one hundred sixty-two billion, seven million, two hundred fifty-five thousand, seven hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •