Base | Representation |
---|---|
bin | 11001011111010010010010… |
… | …010111101111010000001101 |
3 | 112200220202112112212120111002 |
4 | 121133102102113233100031 |
5 | 104143131024120400442 |
6 | 1034230311350110045 |
7 | 32420015546055032 |
oct | 3137222227572015 |
9 | 480822475776432 |
10 | 112101102121997 |
11 | 3279a8a07506aa |
12 | 106a5b4034b325 |
13 | 4a7211c789a51 |
14 | 1d97a17d83389 |
15 | ce601857e732 |
hex | 65f4925ef40d |
112101102121997 has 2 divisors, whose sum is σ = 112101102121998. Its totient is φ = 112101102121996.
The previous prime is 112101102121993. The next prime is 112101102122041. The reversal of 112101102121997 is 799121201101211.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104450423569801 + 7650678552196 = 10220099^2 + 2765986^2 .
It is a cyclic number.
It is not a de Polignac number, because 112101102121997 - 22 = 112101102121993 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112101102121997.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112101102121993) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56050551060998 + 56050551060999.
It is an arithmetic number, because the mean of its divisors is an integer number (56050551060999).
Almost surely, 2112101102121997 is an apocalyptic number.
It is an amenable number.
112101102121997 is a deficient number, since it is larger than the sum of its proper divisors (1).
112101102121997 is an equidigital number, since it uses as much as digits as its factorization.
112101102121997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 38.
The spelling of 112101102121997 in words is "one hundred twelve trillion, one hundred one billion, one hundred two million, one hundred twenty-one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •