Base | Representation |
---|---|
bin | 110100010110011111… |
… | …0000110001101011010 |
3 | 101202011222212220121210 |
4 | 1220230332012031122 |
5 | 3320220422004222 |
6 | 123351404243550 |
7 | 11056651023123 |
oct | 1505476061532 |
9 | 352158786553 |
10 | 112423625562 |
11 | 43751229946 |
12 | 199565405b6 |
13 | a7a8668281 |
14 | 562703304a |
15 | 2dcec88d0c |
hex | 1a2cf8635a |
112423625562 has 8 divisors (see below), whose sum is σ = 224847251136. Its totient is φ = 37474541852.
The previous prime is 112423625521. The next prime is 112423625569. The reversal of 112423625562 is 265526324211.
It is a sphenic number, since it is the product of 3 distinct primes.
112423625562 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 112423625562.
It is not an unprimeable number, because it can be changed into a prime (112423625569) 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 3 ways as a sum of consecutive naturals, for example, 9368635458 + ... + 9368635469.
It is an arithmetic number, because the mean of its divisors is an integer number (28105906392).
Almost surely, 2112423625562 is an apocalyptic number.
112423625562 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112423625562 is a wasteful number, since it uses less digits than its factorization.
112423625562 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18737270932.
The product of its digits is 172800, while the sum is 39.
Adding to 112423625562 its reverse (265526324211), we get a palindrome (377949949773).
The spelling of 112423625562 in words is "one hundred twelve billion, four hundred twenty-three million, six hundred twenty-five thousand, five hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •