Base | Representation |
---|---|
bin | 11001011101110100010000… |
… | …101100001101100010001111 |
3 | 112200120002221110222021221210 |
4 | 121131310100230031202033 |
5 | 104140002242400444043 |
6 | 1034112053252425503 |
7 | 32406512634651654 |
oct | 3135642054154217 |
9 | 480502843867853 |
10 | 112000142203023 |
11 | 32760aa2488238 |
12 | 1068a465018293 |
13 | 4a65750134819 |
14 | 1d92b9b649c2b |
15 | ce35a9e2e633 |
hex | 65dd10b0d88f |
112000142203023 has 4 divisors (see below), whose sum is σ = 149333522937368. Its totient is φ = 74666761468680.
The previous prime is 112000142203021. The next prime is 112000142203043. The reversal of 112000142203023 is 320302241000211.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 112000142203023 - 21 = 112000142203021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112000142203021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18666690367168 + ... + 18666690367173.
It is an arithmetic number, because the mean of its divisors is an integer number (37333380734342).
Almost surely, 2112000142203023 is an apocalyptic number.
112000142203023 is a deficient number, since it is larger than the sum of its proper divisors (37333380734345).
112000142203023 is an equidigital number, since it uses as much as digits as its factorization.
112000142203023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37333380734344.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 112000142203023 its reverse (320302241000211), we get a palindrome (432302383203234).
The spelling of 112000142203023 in words is "one hundred twelve trillion, one hundred forty-two million, two hundred three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •