Base | Representation |
---|---|
bin | 110100001010100011… |
… | …0010000000110000101 |
3 | 101201011002020121120212 |
4 | 1220111012100012011 |
5 | 3313410404010041 |
6 | 123243540005205 |
7 | 11044015503254 |
oct | 1502506200605 |
9 | 351132217525 |
10 | 112023110021 |
11 | 43566141669 |
12 | 19864390805 |
13 | a7436a6124 |
14 | 55c9b7679b |
15 | 2da9a228eb |
hex | 1a15190185 |
112023110021 has 8 divisors (see below), whose sum is σ = 118144540320. Its totient is φ = 105924227472.
The previous prime is 112023110011. The next prime is 112023110063. The reversal of 112023110021 is 120011320211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112023110021 - 210 = 112023108997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112023109978 and 112023110005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112023110011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5626730 + ... + 5646603.
It is an arithmetic number, because the mean of its divisors is an integer number (14768067540).
Almost surely, 2112023110021 is an apocalyptic number.
It is an amenable number.
112023110021 is a deficient number, since it is larger than the sum of its proper divisors (6121430299).
112023110021 is a wasteful number, since it uses less digits than its factorization.
112023110021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11273875.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 112023110021 its reverse (120011320211), we get a palindrome (232034430232).
The spelling of 112023110021 in words is "one hundred twelve billion, twenty-three million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •