Base | Representation |
---|---|
bin | 11101111010001000011… |
… | …10111110110111101001 |
3 | 10122020112010122120202222 |
4 | 32331010032332313221 |
5 | 113314102320240321 |
6 | 2104031525403425 |
7 | 134146632360266 |
oct | 16750416766751 |
9 | 3566463576688 |
10 | 1027641961961 |
11 | 36690310805a |
12 | 1471b7269575 |
13 | 75ba1c77854 |
14 | 37a4963626d |
15 | 1bae83573ab |
hex | ef443bede9 |
1027641961961 has 2 divisors, whose sum is σ = 1027641961962. Its totient is φ = 1027641961960.
The previous prime is 1027641961949. The next prime is 1027641962027. The reversal of 1027641961961 is 1691691467201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1009140793600 + 18501168361 = 1004560^2 + 136019^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1027641961961 is a prime.
It is not a weakly prime, because it can be changed into another prime (1027641961901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 513820980980 + 513820980981.
It is an arithmetic number, because the mean of its divisors is an integer number (513820980981).
Almost surely, 21027641961961 is an apocalyptic number.
It is an amenable number.
1027641961961 is a deficient number, since it is larger than the sum of its proper divisors (1).
1027641961961 is an equidigital number, since it uses as much as digits as its factorization.
1027641961961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 979776, while the sum is 53.
The spelling of 1027641961961 in words is "one trillion, twenty-seven billion, six hundred forty-one million, nine hundred sixty-one thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •