Base | Representation |
---|---|
bin | 11001011111011011101100… |
… | …010000110110110100011011 |
3 | 112200221201121022012012002120 |
4 | 121133123230100312310123 |
5 | 104143312214222431021 |
6 | 1034235101355032323 |
7 | 32420524024244403 |
oct | 3137335420666433 |
9 | 480851538165076 |
10 | 112111200202011 |
11 | 327a410286567a |
12 | 106a7a9a13b6a3 |
13 | 4a7306b897b1a |
14 | 1d982d5157803 |
15 | ce6409d632c6 |
hex | 65f6ec436d1b |
112111200202011 has 8 divisors (see below), whose sum is σ = 149500098210384. Its totient is φ = 74731551164160.
The previous prime is 112111200201983. The next prime is 112111200202033. The reversal of 112111200202011 is 110202002111211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112111200202011 - 229 = 112110663331099 is a prime.
It is not an unprimeable number, because it can be changed into a prime (112111200202081) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2312214346 + ... + 2312262831.
It is an arithmetic number, because the mean of its divisors is an integer number (18687512276298).
Almost surely, 2112111200202011 is an apocalyptic number.
112111200202011 is a deficient number, since it is larger than the sum of its proper divisors (37388898008373).
112111200202011 is an equidigital number, since it uses as much as digits as its factorization.
112111200202011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4624485261.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 112111200202011 its reverse (110202002111211), we get a palindrome (222313202313222).
It can be divided in two parts, 112111200 and 202011, that added together give a palindrome (112313211).
The spelling of 112111200202011 in words is "one hundred twelve trillion, one hundred eleven billion, two hundred million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •