Base | Representation |
---|---|
bin | 11001100000110001010001… |
… | …111110101000011111110001 |
3 | 112201021111211000210011001222 |
4 | 121200301101332220133301 |
5 | 104201313422324422001 |
6 | 1034345220520234425 |
7 | 32430256304252024 |
oct | 3140612176503761 |
9 | 481244730704058 |
10 | 112203101014001 |
11 | 3282a082436968 |
12 | 1070186760ba15 |
13 | 4a7b92644640a |
14 | 1d9c9326911bb |
15 | ce89d800d61b |
hex | 660c51fa87f1 |
112203101014001 has 2 divisors, whose sum is σ = 112203101014002. Its totient is φ = 112203101014000.
The previous prime is 112203101013889. The next prime is 112203101014019. The reversal of 112203101014001 is 100410101302211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 64168831197025 + 48034269816976 = 8010545^2 + 6930676^2 .
It is a cyclic number.
It is not a de Polignac number, because 112203101014001 - 218 = 112203100751857 is a prime.
It is a super-2 number, since 2×1122031010140012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (112203101019001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56101550507000 + 56101550507001.
It is an arithmetic number, because the mean of its divisors is an integer number (56101550507001).
Almost surely, 2112203101014001 is an apocalyptic number.
It is an amenable number.
112203101014001 is a deficient number, since it is larger than the sum of its proper divisors (1).
112203101014001 is an equidigital number, since it uses as much as digits as its factorization.
112203101014001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 112203101014001 its reverse (100410101302211), we get a palindrome (212613202316212).
The spelling of 112203101014001 in words is "one hundred twelve trillion, two hundred three billion, one hundred one million, fourteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •