Base | Representation |
---|---|
bin | 11001011110001000101000… |
… | …101110001001011010101111 |
3 | 112200122012102012021200220020 |
4 | 121132020220232021122233 |
5 | 104140332044132400421 |
6 | 1034130112230053223 |
7 | 32411216042605020 |
oct | 3136105056113257 |
9 | 480565365250806 |
10 | 112022020200111 |
11 | 3276a2a9aa426a |
12 | 1069274baaa213 |
13 | 4a6782890b028 |
14 | 1d93c7510cc47 |
15 | ce3e3a9addc6 |
hex | 65e228b896af |
112022020200111 has 8 divisors (see below), whose sum is σ = 170700221257344. Its totient is φ = 64012582971480.
The previous prime is 112022020200031. The next prime is 112022020200137. The reversal of 112022020200111 is 111002020220211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112022020200111 - 214 = 112022020183727 is a prime.
It is a super-3 number, since 3×1120220202001113 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112022020202111) 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, 2667190957125 + ... + 2667190957166.
It is an arithmetic number, because the mean of its divisors is an integer number (21337527657168).
Almost surely, 2112022020200111 is an apocalyptic number.
112022020200111 is a deficient number, since it is larger than the sum of its proper divisors (58678201057233).
112022020200111 is an equidigital number, since it uses as much as digits as its factorization.
112022020200111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5334381914301.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 112022020200111 its reverse (111002020220211), we get a palindrome (223024040420322).
The spelling of 112022020200111 in words is "one hundred twelve trillion, twenty-two billion, twenty million, two hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •