Base | Representation |
---|---|
bin | 110100010011001100… |
… | …1010100111001011110 |
3 | 101201220022022222002111 |
4 | 1220212121110321132 |
5 | 3320004202314402 |
6 | 123332424144234 |
7 | 11054141331451 |
oct | 1504631247136 |
9 | 351808288074 |
10 | 112313323102 |
11 | 436a4a40a92 |
12 | 1992560807a |
13 | a78b858346 |
14 | 561651d498 |
15 | 2dc524b9d7 |
hex | 1a26654e5e |
112313323102 has 4 divisors (see below), whose sum is σ = 168469984656. Its totient is φ = 56156661550.
The previous prime is 112313323097. The next prime is 112313323117. The reversal of 112313323102 is 201323313211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 201323313211 = 89 ⋅2262059699.
It is a super-2 number, since 2×1123133231022 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 28078330774 + ... + 28078330777.
It is an arithmetic number, because the mean of its divisors is an integer number (42117496164).
Almost surely, 2112313323102 is an apocalyptic number.
112313323102 is a deficient number, since it is larger than the sum of its proper divisors (56156661554).
112313323102 is an equidigital number, since it uses as much as digits as its factorization.
112313323102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56156661553.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 112313323102 its reverse (201323313211), we get a palindrome (313636636313).
It can be divided in two parts, 11231 and 3323102, that added together give a palindrome (3334333).
The spelling of 112313323102 in words is "one hundred twelve billion, three hundred thirteen million, three hundred twenty-three thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •