Base | Representation |
---|---|
bin | 11001100010011000110111… |
… | …110011011100101111001011 |
3 | 112201200010220211200010102012 |
4 | 121202120313303130233023 |
5 | 104210124222220234311 |
6 | 1034512254045330135 |
7 | 32441304552611312 |
oct | 3142306763345713 |
9 | 481603824603365 |
10 | 112314331024331 |
11 | 3287227091aa37 |
12 | 1071b32a26694b |
13 | 4a89271714387 |
14 | 1da4084d77279 |
15 | ceb8480bd78b |
hex | 662637cdcbcb |
112314331024331 has 4 divisors (see below), whose sum is σ = 112314359140200. Its totient is φ = 112314302908464.
The previous prime is 112314331024297. The next prime is 112314331024369. The reversal of 112314331024331 is 133420133413211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 112314331024331 - 226 = 112314263915467 is a prime.
It is a super-2 number, since 2×1123143310243312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112314331014331) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6825641 + ... + 16468698.
It is an arithmetic number, because the mean of its divisors is an integer number (28078589785050).
Almost surely, 2112314331024331 is an apocalyptic number.
112314331024331 is a deficient number, since it is larger than the sum of its proper divisors (28115869).
112314331024331 is an equidigital number, since it uses as much as digits as its factorization.
112314331024331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28115868.
The product of its (nonzero) digits is 15552, while the sum is 32.
Adding to 112314331024331 its reverse (133420133413211), we get a palindrome (245734464437542).
The spelling of 112314331024331 in words is "one hundred twelve trillion, three hundred fourteen billion, three hundred thirty-one million, twenty-four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •