Base | Representation |
---|---|
bin | 10001110000010100010… |
… | …111100011100000100101 |
3 | 11022122022201210110202112 |
4 | 101300110113203200211 |
5 | 124442242240244031 |
6 | 2332302323450405 |
7 | 154102344355352 |
oct | 21602427434045 |
9 | 4278281713675 |
10 | 1220112431141 |
11 | 4304a072830a |
12 | 178571226a05 |
13 | 8b096369436 |
14 | 430a7719629 |
15 | 21b1076462b |
hex | 11c145e3825 |
1220112431141 has 2 divisors, whose sum is σ = 1220112431142. Its totient is φ = 1220112431140.
The previous prime is 1220112431101. The next prime is 1220112431171. The reversal of 1220112431141 is 1411342110221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 689640558916 + 530471872225 = 830446^2 + 728335^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1220112431141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1220112431101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 610056215570 + 610056215571.
It is an arithmetic number, because the mean of its divisors is an integer number (610056215571).
Almost surely, 21220112431141 is an apocalyptic number.
It is an amenable number.
1220112431141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1220112431141 is an equidigital number, since it uses as much as digits as its factorization.
1220112431141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 1220112431141 its reverse (1411342110221), we get a palindrome (2631454541362).
The spelling of 1220112431141 in words is "one trillion, two hundred twenty billion, one hundred twelve million, four hundred thirty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •