Base | Representation |
---|---|
bin | 11001011101110101000100… |
… | …100010111111101000011011 |
3 | 112200120012012010000211012112 |
4 | 121131311010202333220123 |
5 | 104140011033110431021 |
6 | 1034112315451502535 |
7 | 32406543330556112 |
oct | 3135650442775033 |
9 | 480505163024175 |
10 | 112001012202011 |
11 | 327613a9589369 |
12 | 1068a668457a4b |
13 | 4a6585b45591a |
14 | 1d92c40dd6c79 |
15 | ce360b4d1d5b |
hex | 65dd448bfa1b |
112001012202011 has 4 divisors (see below), whose sum is σ = 112569545259072. Its totient is φ = 111432479144952.
The previous prime is 112001012201959. The next prime is 112001012202017. The reversal of 112001012202011 is 110202210100211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112001012202011 is a prime.
It is a super-2 number, since 2×1120010122020112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112001012202017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 284266528235 + ... + 284266528628.
It is an arithmetic number, because the mean of its divisors is an integer number (28142386314768).
Almost surely, 2112001012202011 is an apocalyptic number.
112001012202011 is a deficient number, since it is larger than the sum of its proper divisors (568533057061).
112001012202011 is an equidigital number, since it uses as much as digits as its factorization.
112001012202011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 568533057060.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 112001012202011 its reverse (110202210100211), we get a palindrome (222203222302222).
The spelling of 112001012202011 in words is "one hundred twelve trillion, one billion, twelve million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •