Base | Representation |
---|---|
bin | 110100001101110101… |
… | …0101101100100001011 |
3 | 101201102202122102122011 |
4 | 1220123222231210023 |
5 | 3314122113044321 |
6 | 123302514240351 |
7 | 11046524405656 |
oct | 1503352554413 |
9 | 351382572564 |
10 | 112133331211 |
11 | 43612384460 |
12 | 198952860b7 |
13 | a760488075 |
14 | 55da66889d |
15 | 2db4545ae1 |
hex | 1a1baad90b |
112133331211 has 8 divisors (see below), whose sum is σ = 122422186800. Its totient is φ = 101860295040.
The previous prime is 112133331199. The next prime is 112133331229.
112133331211 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112133331211 - 217 = 112133200139 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112133331311) 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 7 ways as a sum of consecutive naturals, for example, 3940026 + ... + 3968383.
It is an arithmetic number, because the mean of its divisors is an integer number (15302773350).
Almost surely, 2112133331211 is an apocalyptic number.
112133331211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
112133331211 is a deficient number, since it is larger than the sum of its proper divisors (10288855589).
112133331211 is a wasteful number, since it uses less digits than its factorization.
112133331211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7909709.
The product of its digits is 324, while the sum is 22.
It can be divided in two parts, 112133 and 331211, that added together give a palindrome (443344).
The spelling of 112133331211 in words is "one hundred twelve billion, one hundred thirty-three million, three hundred thirty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •