Base | Representation |
---|---|
bin | 11001011101110101000011… |
… | …111100000100111101001001 |
3 | 112200120012011101211111221201 |
4 | 121131311003330010331021 |
5 | 104140011023003001301 |
6 | 1034112314445104201 |
7 | 32406543145056166 |
oct | 3135650374047511 |
9 | 480505141744851 |
10 | 112001002000201 |
11 | 327613a3850616 |
12 | 1068a664b58061 |
13 | 4a658592c3252 |
14 | 1d92c3d8dd06d |
15 | ce360a669201 |
hex | 65dd43f04f49 |
112001002000201 has 4 divisors (see below), whose sum is σ = 112086695193552. Its totient is φ = 111915308806852.
The previous prime is 112001002000193. The next prime is 112001002000247. The reversal of 112001002000201 is 102000200100211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 112001002000201 - 23 = 112001002000193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112001002003201) 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, 42846594715 + ... + 42846597328.
It is an arithmetic number, because the mean of its divisors is an integer number (28021673798388).
Almost surely, 2112001002000201 is an apocalyptic number.
It is an amenable number.
112001002000201 is a deficient number, since it is larger than the sum of its proper divisors (85693193351).
112001002000201 is an equidigital number, since it uses as much as digits as its factorization.
112001002000201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85693193350.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 112001002000201 its reverse (102000200100211), we get a palindrome (214001202100412).
The spelling of 112001002000201 in words is "one hundred twelve trillion, one billion, two million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •