Base | Representation |
---|---|
bin | 110100010011001100… |
… | …0000110110011001011 |
3 | 101201220021201201021200 |
4 | 1220212120012303023 |
5 | 3320004112100321 |
6 | 123332413235243 |
7 | 11054135530023 |
oct | 1504630066313 |
9 | 351807651250 |
10 | 112313003211 |
11 | 436a4842712 |
12 | 19925492b23 |
13 | a78b775866 |
14 | 5616478a83 |
15 | 2dc51d6d26 |
hex | 1a26606ccb |
112313003211 has 6 divisors (see below), whose sum is σ = 162229893540. Its totient is φ = 74875335468.
The previous prime is 112313003177. The next prime is 112313003321. The reversal of 112313003211 is 112300313211.
112313003211 is a `hidden beast` number, since 1 + 12 + 31 + 300 + 321 + 1 = 666.
It is not a de Polignac number, because 112313003211 - 26 = 112313003147 is a prime.
It is a super-2 number, since 2×1123130032112 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112313001211) 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 5 ways as a sum of consecutive naturals, for example, 6239611281 + ... + 6239611298.
It is an arithmetic number, because the mean of its divisors is an integer number (27038315590).
Almost surely, 2112313003211 is an apocalyptic number.
112313003211 is a deficient number, since it is larger than the sum of its proper divisors (49916890329).
112313003211 is a wasteful number, since it uses less digits than its factorization.
112313003211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12479222585 (or 12479222582 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 112313003211 its reverse (112300313211), we get a palindrome (224613316422).
The spelling of 112313003211 in words is "one hundred twelve billion, three hundred thirteen million, three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •