Base | Representation |
---|---|
bin | 110100001101100010… |
… | …0001011110001100011 |
3 | 101201102001122022012112 |
4 | 1220123010023301203 |
5 | 3314112021400311 |
6 | 123301513545535 |
7 | 11046342512156 |
oct | 1503304136143 |
9 | 351361568175 |
10 | 112123231331 |
11 | 43607706251 |
12 | 19891a152ab |
13 | a75b35cbc7 |
14 | 55d9199c9d |
15 | 2db36ed28b |
hex | 1a1b10bc63 |
112123231331 has 16 divisors (see below), whose sum is σ = 113042764800. Its totient is φ = 111208775040.
The previous prime is 112123231307. The next prime is 112123231393. The reversal of 112123231331 is 133132321211.
It is a cyclic number.
It is not a de Polignac number, because 112123231331 - 26 = 112123231267 is a prime.
It is a super-2 number, since 2×1121232313312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112123231297 and 112123231306.
It is not an unprimeable number, because it can be changed into a prime (112123281331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 80144570 + ... + 80145968.
It is an arithmetic number, because the mean of its divisors is an integer number (7065172800).
Almost surely, 2112123231331 is an apocalyptic number.
112123231331 is a deficient number, since it is larger than the sum of its proper divisors (919533469).
112123231331 is a wasteful number, since it uses less digits than its factorization.
112123231331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2786.
The product of its digits is 648, while the sum is 23.
Adding to 112123231331 its reverse (133132321211), we get a palindrome (245255552542).
The spelling of 112123231331 in words is "one hundred twelve billion, one hundred twenty-three million, two hundred thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •