Base | Representation |
---|---|
bin | 11001100000101110011111… |
… | …000110101011010011001101 |
3 | 112201021020001212211220010022 |
4 | 121200232133012223103031 |
5 | 104201241301100012343 |
6 | 1034344003034151525 |
7 | 32430122034126635 |
oct | 3140563706532315 |
9 | 481236055756108 |
10 | 112200100000973 |
11 | 32828882444406 |
12 | 1070116a5825a5 |
13 | 4a7b568798a6a |
14 | 1d9c729ca36c5 |
15 | ce88ae819568 |
hex | 660b9f1ab4cd |
112200100000973 has 2 divisors, whose sum is σ = 112200100000974. Its totient is φ = 112200100000972.
The previous prime is 112200100000931. The next prime is 112200100001027. The reversal of 112200100000973 is 379000001002211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 91494524086729 + 20705575914244 = 9565277^2 + 4550338^2 .
It is an emirp because it is prime and its reverse (379000001002211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112200100000973 - 28 = 112200100000717 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112200100000873) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56100050000486 + 56100050000487.
It is an arithmetic number, because the mean of its divisors is an integer number (56100050000487).
Almost surely, 2112200100000973 is an apocalyptic number.
It is an amenable number.
112200100000973 is a deficient number, since it is larger than the sum of its proper divisors (1).
112200100000973 is an equidigital number, since it uses as much as digits as its factorization.
112200100000973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 26.
The spelling of 112200100000973 in words is "one hundred twelve trillion, two hundred billion, one hundred million, nine hundred seventy-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •