Base | Representation |
---|---|
bin | 111011101100110010… |
… | …0110101010110000001 |
3 | 110020220210010102220211 |
4 | 1313121210311112001 |
5 | 4100030304110022 |
6 | 134521332234121 |
7 | 12156011051314 |
oct | 1673144652601 |
9 | 406823112824 |
10 | 128204363137 |
11 | 4a40a025624 |
12 | 20a1b46b941 |
13 | c121b81706 |
14 | 62c2c0a97b |
15 | 35053bce77 |
hex | 1dd9935581 |
128204363137 has 2 divisors, whose sum is σ = 128204363138. Its totient is φ = 128204363136.
The previous prime is 128204363117. The next prime is 128204363141. The reversal of 128204363137 is 731363402821.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 115162494736 + 13041868401 = 339356^2 + 114201^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-128204363137 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 128204363137.
It is not a weakly prime, because it can be changed into another prime (128204363107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 64102181568 + 64102181569.
It is an arithmetic number, because the mean of its divisors is an integer number (64102181569).
Almost surely, 2128204363137 is an apocalyptic number.
It is an amenable number.
128204363137 is a deficient number, since it is larger than the sum of its proper divisors (1).
128204363137 is an equidigital number, since it uses as much as digits as its factorization.
128204363137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 145152, while the sum is 40.
Adding to 128204363137 its reverse (731363402821), we get a palindrome (859567765958).
The spelling of 128204363137 in words is "one hundred twenty-eight billion, two hundred four million, three hundred sixty-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •