Base | Representation |
---|---|
bin | 110100010000101111… |
… | …1101011001011000011 |
3 | 101201200120121122202000 |
4 | 1220201133223023003 |
5 | 3314322130213443 |
6 | 123320325555043 |
7 | 11052122422311 |
oct | 1504137531303 |
9 | 351616548660 |
10 | 112231101123 |
11 | 43662592439 |
12 | 19901b75a83 |
13 | a7777ca79b |
14 | 56096390b1 |
15 | 2dbce098d3 |
hex | 1a217eb2c3 |
112231101123 has 32 divisors (see below), whose sum is σ = 167940864000. Its totient is φ = 74068587648.
The previous prime is 112231101113. The next prime is 112231101161. The reversal of 112231101123 is 321101132211.
It is not a de Polignac number, because 112231101123 - 25 = 112231101091 is a prime.
It is a super-2 number, since 2×1122311011232 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112231101096 and 112231101105.
It is not an unprimeable number, because it can be changed into a prime (112231101113) 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 31 ways as a sum of consecutive naturals, for example, 11255286 + ... + 11265252.
It is an arithmetic number, because the mean of its divisors is an integer number (5248152000).
Almost surely, 2112231101123 is an apocalyptic number.
112231101123 is a deficient number, since it is larger than the sum of its proper divisors (55709762877).
112231101123 is a wasteful number, since it uses less digits than its factorization.
112231101123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14128 (or 14122 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 112231101123 its reverse (321101132211), we get a palindrome (433332233334).
The spelling of 112231101123 in words is "one hundred twelve billion, two hundred thirty-one million, one hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •