Base | Representation |
---|---|
bin | 11001100111000000000010… |
… | …000100001100101011011011 |
3 | 112202210102221221212002101222 |
4 | 121213000002010030223123 |
5 | 104230322303244301433 |
6 | 1035314030221402255 |
7 | 32503224355304255 |
oct | 3147000204145333 |
9 | 482712857762358 |
10 | 112631257025243 |
11 | 32984714333240 |
12 | 1077083810938b |
13 | 4ab010b0c7528 |
14 | 1db554c014cd5 |
15 | d04be66d8b98 |
hex | 66700210cadb |
112631257025243 has 16 divisors (see below), whose sum is σ = 126835141954560. Its totient is φ = 99088210202400.
The previous prime is 112631257025237. The next prime is 112631257025251. The reversal of 112631257025243 is 342520752136211.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 112631257025243 - 222 = 112631252830939 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112631257025194 and 112631257025203.
It is not an unprimeable number, because it can be changed into a prime (112631257025213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 38989796 + ... + 41778782.
It is an arithmetic number, because the mean of its divisors is an integer number (7927196372160).
Almost surely, 2112631257025243 is an apocalyptic number.
112631257025243 is a deficient number, since it is larger than the sum of its proper divisors (14203884929317).
112631257025243 is a wasteful number, since it uses less digits than its factorization.
112631257025243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2907458.
The product of its (nonzero) digits is 604800, while the sum is 44.
The spelling of 112631257025243 in words is "one hundred twelve trillion, six hundred thirty-one billion, two hundred fifty-seven million, twenty-five thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •