Base | Representation |
---|---|
bin | 11001011110011011100010… |
… | …111011001010010100100011 |
3 | 112200201010211012112210021220 |
4 | 121132123202323022110203 |
5 | 104141200134423334133 |
6 | 1034143311051550123 |
7 | 32412535144455252 |
oct | 3136334273122443 |
9 | 480633735483256 |
10 | 112042324043043 |
11 | 32777978a91a49 |
12 | 1069667775b343 |
13 | 4a6971322a984 |
14 | 1d94c3d8c8799 |
15 | ce47282475b3 |
hex | 65e6e2eca523 |
112042324043043 has 4 divisors (see below), whose sum is σ = 149389765390728. Its totient is φ = 74694882695360.
The previous prime is 112042324043009. The next prime is 112042324043051. The reversal of 112042324043043 is 340340423240211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 112042324043043 - 241 = 109843300787491 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112042324042995 and 112042324043013.
It is not an unprimeable number, because it can be changed into a prime (112042324048043) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18673720673838 + ... + 18673720673843.
It is an arithmetic number, because the mean of its divisors is an integer number (37347441347682).
Almost surely, 2112042324043043 is an apocalyptic number.
112042324043043 is a deficient number, since it is larger than the sum of its proper divisors (37347441347685).
112042324043043 is an equidigital number, since it uses as much as digits as its factorization.
112042324043043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37347441347684.
The product of its (nonzero) digits is 55296, while the sum is 33.
Adding to 112042324043043 its reverse (340340423240211), we get a palindrome (452382747283254).
The spelling of 112042324043043 in words is "one hundred twelve trillion, forty-two billion, three hundred twenty-four million, forty-three thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •