Base | Representation |
---|---|
bin | 10000011000110010010… |
… | …110010000001110101101 |
3 | 10222122201122222110222221 |
4 | 100120302112100032231 |
5 | 121422301242012442 |
6 | 2221200223035341 |
7 | 144234312064045 |
oct | 20306226201655 |
9 | 3878648873887 |
10 | 1126126125997 |
11 | 3a4650927164 |
12 | 16230143bb51 |
13 | 8226870c022 |
14 | 3c70d230725 |
15 | 1e45e46a467 |
hex | 106325903ad |
1126126125997 has 2 divisors, whose sum is σ = 1126126125998. Its totient is φ = 1126126125996.
The previous prime is 1126126125983. The next prime is 1126126126003. The reversal of 1126126125997 is 7995216216211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 870468474121 + 255657651876 = 932989^2 + 505626^2 .
It is a cyclic number.
It is not a de Polignac number, because 1126126125997 - 235 = 1091766387629 is a prime.
It is a super-2 number, since 2×11261261259972 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1126126125907) 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, 563063062998 + 563063062999.
It is an arithmetic number, because the mean of its divisors is an integer number (563063062999).
Almost surely, 21126126125997 is an apocalyptic number.
It is an amenable number.
1126126125997 is a deficient number, since it is larger than the sum of its proper divisors (1).
1126126125997 is an equidigital number, since it uses as much as digits as its factorization.
1126126125997 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 816480, while the sum is 52.
The spelling of 1126126125997 in words is "one trillion, one hundred twenty-six billion, one hundred twenty-six million, one hundred twenty-five thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •