Base | Representation |
---|---|
bin | 11001011111010010011001… |
… | …011001110010011101101101 |
3 | 112200220202211202212110210212 |
4 | 121133102121121302131231 |
5 | 104143131244321144244 |
6 | 1034230331202512205 |
7 | 32420021510625053 |
oct | 3137223131623555 |
9 | 480822752773725 |
10 | 112101220099949 |
11 | 3279a951301243 |
12 | 106a5b73965665 |
13 | 4a7213b0564a2 |
14 | 1d97a298d41d3 |
15 | ce6023ad5d9e |
hex | 65f49967276d |
112101220099949 has 2 divisors, whose sum is σ = 112101220099950. Its totient is φ = 112101220099948.
The previous prime is 112101220099937. The next prime is 112101220100141. The reversal of 112101220099949 is 949990022101211.
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., 58150461666025 + 53950758433924 = 7625645^2 + 7345118^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112101220099949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112101220099897 and 112101220099906.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112101220099909) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56050610049974 + 56050610049975.
It is an arithmetic number, because the mean of its divisors is an integer number (56050610049975).
Almost surely, 2112101220099949 is an apocalyptic number.
It is an amenable number.
112101220099949 is a deficient number, since it is larger than the sum of its proper divisors (1).
112101220099949 is an equidigital number, since it uses as much as digits as its factorization.
112101220099949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 209952, while the sum is 50.
The spelling of 112101220099949 in words is "one hundred twelve trillion, one hundred one billion, two hundred twenty million, ninety-nine thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •